./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label46.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 55bb0b6283aff4abf5faadff9f7f9aff6ee42cf1532c03b428b7b431fbde06be --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 12:03:53,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 12:03:53,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 12:03:53,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 12:03:53,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 12:03:53,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 12:03:53,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 12:03:53,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 12:03:53,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 12:03:53,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 12:03:53,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 12:03:53,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 12:03:53,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 12:03:53,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 12:03:53,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 12:03:53,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 12:03:53,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 12:03:53,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 12:03:53,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 12:03:53,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 12:03:53,943 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 12:03:53,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 12:03:53,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 12:03:53,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 12:03:53,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 12:03:53,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 12:03:53,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 12:03:53,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 12:03:53,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 12:03:53,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 12:03:53,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 12:03:53,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 12:03:53,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 12:03:53,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 12:03:53,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 12:03:53,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 12:03:53,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 12:03:53,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 12:03:53,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 12:03:53,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 12:03:53,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 12:03:53,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 12:03:53,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 12:03:53,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 12:03:53,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 12:03:53,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 12:03:53,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 12:03:53,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 12:03:53,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 12:03:53,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 12:03:53,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 12:03:53,994 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 12:03:53,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 12:03:53,995 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 12:03:53,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 12:03:53,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 12:03:53,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 12:03:53,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 12:03:53,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 12:03:53,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 12:03:53,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 12:03:53,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 12:03:53,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 12:03:53,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 12:03:53,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 12:03:53,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 12:03:53,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 12:03:53,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 12:03:53,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 12:03:54,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 12:03:54,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 12:03:54,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 12:03:54,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 12:03:54,001 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 12:03:54,001 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 12:03:54,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 12:03:54,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55bb0b6283aff4abf5faadff9f7f9aff6ee42cf1532c03b428b7b431fbde06be [2022-07-19 12:03:54,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 12:03:54,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 12:03:54,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 12:03:54,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 12:03:54,267 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 12:03:54,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2022-07-19 12:03:54,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30090090/6fcee27de0744c639d3e8487d508152d/FLAG3d3719850 [2022-07-19 12:03:54,736 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 12:03:54,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label46.c [2022-07-19 12:03:54,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30090090/6fcee27de0744c639d3e8487d508152d/FLAG3d3719850 [2022-07-19 12:03:55,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30090090/6fcee27de0744c639d3e8487d508152d [2022-07-19 12:03:55,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 12:03:55,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 12:03:55,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 12:03:55,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 12:03:55,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 12:03:55,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:55,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fdc379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55, skipping insertion in model container [2022-07-19 12:03:55,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:55,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 12:03:55,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 12:03:55,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label46.c[2596,2609] [2022-07-19 12:03:55,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 12:03:55,660 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 12:03:55,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label46.c[2596,2609] [2022-07-19 12:03:55,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 12:03:55,816 INFO L208 MainTranslator]: Completed translation [2022-07-19 12:03:55,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55 WrapperNode [2022-07-19 12:03:55,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 12:03:55,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 12:03:55,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 12:03:55,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 12:03:55,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:55,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:55,951 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2022-07-19 12:03:55,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 12:03:55,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 12:03:55,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 12:03:55,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 12:03:55,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:55,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:55,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:55,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:56,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:56,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:56,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:56,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 12:03:56,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 12:03:56,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 12:03:56,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 12:03:56,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (1/1) ... [2022-07-19 12:03:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 12:03:56,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 12:03:56,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 12:03:56,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 12:03:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 12:03:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 12:03:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 12:03:56,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 12:03:56,217 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 12:03:56,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 12:03:57,316 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 12:03:57,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 12:03:57,326 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 12:03:57,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 12:03:57 BoogieIcfgContainer [2022-07-19 12:03:57,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 12:03:57,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 12:03:57,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 12:03:57,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 12:03:57,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 12:03:55" (1/3) ... [2022-07-19 12:03:57,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530c41bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 12:03:57, skipping insertion in model container [2022-07-19 12:03:57,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:03:55" (2/3) ... [2022-07-19 12:03:57,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530c41bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 12:03:57, skipping insertion in model container [2022-07-19 12:03:57,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 12:03:57" (3/3) ... [2022-07-19 12:03:57,355 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label46.c [2022-07-19 12:03:57,370 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 12:03:57,382 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 12:03:57,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 12:03:57,454 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@173e4c23, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4140433a [2022-07-19 12:03:57,455 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 12:03:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:03:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 12:03:57,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:03:57,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 12:03:57,476 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:03:57,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:03:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash -85512855, now seen corresponding path program 1 times [2022-07-19 12:03:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:03:57,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588072894] [2022-07-19 12:03:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:03:57,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:03:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:03:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 12:03:57,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:03:57,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588072894] [2022-07-19 12:03:57,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588072894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:03:57,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:03:57,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 12:03:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864477315] [2022-07-19 12:03:57,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:03:57,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:03:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:03:57,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:03:57,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:03:57,917 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:03:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:03:58,652 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2022-07-19 12:03:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:03:58,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 12:03:58,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:03:58,674 INFO L225 Difference]: With dead ends: 552 [2022-07-19 12:03:58,674 INFO L226 Difference]: Without dead ends: 282 [2022-07-19 12:03:58,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:03:58,688 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 12:03:58,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 12:03:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-19 12:03:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-07-19 12:03:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:03:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2022-07-19 12:03:58,762 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 21 [2022-07-19 12:03:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:03:58,763 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2022-07-19 12:03:58,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:03:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2022-07-19 12:03:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-19 12:03:58,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:03:58,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 12:03:58,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 12:03:58,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:03:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:03:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash -86180708, now seen corresponding path program 1 times [2022-07-19 12:03:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:03:58,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796707375] [2022-07-19 12:03:58,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:03:58,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:03:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:03:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 12:03:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:03:58,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796707375] [2022-07-19 12:03:58,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796707375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:03:58,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:03:58,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:03:58,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785481367] [2022-07-19 12:03:58,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:03:58,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:03:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:03:58,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:03:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:03:58,908 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:03:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:03:59,360 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2022-07-19 12:03:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:03:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-07-19 12:03:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:03:59,363 INFO L225 Difference]: With dead ends: 701 [2022-07-19 12:03:59,363 INFO L226 Difference]: Without dead ends: 421 [2022-07-19 12:03:59,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:03:59,365 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 125 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 12:03:59,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 12:03:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-07-19 12:03:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2022-07-19 12:03:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:03:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2022-07-19 12:03:59,379 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 87 [2022-07-19 12:03:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:03:59,380 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2022-07-19 12:03:59,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:03:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2022-07-19 12:03:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-19 12:03:59,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:03:59,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 12:03:59,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 12:03:59,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:03:59,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:03:59,386 INFO L85 PathProgramCache]: Analyzing trace with hash -236744949, now seen corresponding path program 1 times [2022-07-19 12:03:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:03:59,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650235734] [2022-07-19 12:03:59,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:03:59,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:03:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:03:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 12:03:59,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:03:59,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650235734] [2022-07-19 12:03:59,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650235734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:03:59,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:03:59,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 12:03:59,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051594197] [2022-07-19 12:03:59,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:03:59,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:03:59,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:03:59,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:03:59,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:03:59,578 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:04:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:04:00,043 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2022-07-19 12:04:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:04:00,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-19 12:04:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:04:00,047 INFO L225 Difference]: With dead ends: 979 [2022-07-19 12:04:00,047 INFO L226 Difference]: Without dead ends: 560 [2022-07-19 12:04:00,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:04:00,049 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 12:04:00,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 12:04:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-07-19 12:04:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2022-07-19 12:04:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:04:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2022-07-19 12:04:00,060 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 94 [2022-07-19 12:04:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:04:00,061 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2022-07-19 12:04:00,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:04:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2022-07-19 12:04:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-19 12:04:00,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:04:00,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 12:04:00,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 12:04:00,063 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:04:00,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:04:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 404934448, now seen corresponding path program 1 times [2022-07-19 12:04:00,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:04:00,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716572263] [2022-07-19 12:04:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:04:00,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:04:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 12:04:00,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 12:04:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 12:04:00,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 12:04:00,170 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 12:04:00,171 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 12:04:00,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 12:04:00,175 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-19 12:04:00,179 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 12:04:00,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 12:04:00 BoogieIcfgContainer [2022-07-19 12:04:00,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 12:04:00,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 12:04:00,248 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 12:04:00,248 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 12:04:00,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 12:03:57" (3/4) ... [2022-07-19 12:04:00,250 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 12:04:00,314 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 12:04:00,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 12:04:00,315 INFO L158 Benchmark]: Toolchain (without parser) took 5227.55ms. Allocated memory was 88.1MB in the beginning and 172.0MB in the end (delta: 83.9MB). Free memory was 48.7MB in the beginning and 117.0MB in the end (delta: -68.2MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-07-19 12:04:00,316 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 88.1MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 12:04:00,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.24ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 48.6MB in the beginning and 79.2MB in the end (delta: -30.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-07-19 12:04:00,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.95ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 71.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 12:04:00,317 INFO L158 Benchmark]: Boogie Preprocessor took 103.44ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 66.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 12:04:00,317 INFO L158 Benchmark]: RCFGBuilder took 1271.77ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 60.8MB in the end (delta: 5.9MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-07-19 12:04:00,317 INFO L158 Benchmark]: TraceAbstraction took 2915.82ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 59.9MB in the beginning and 124.3MB in the end (delta: -64.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 12:04:00,318 INFO L158 Benchmark]: Witness Printer took 67.43ms. Allocated memory is still 172.0MB. Free memory was 124.3MB in the beginning and 117.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 12:04:00,319 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 88.1MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.24ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 48.6MB in the beginning and 79.2MB in the end (delta: -30.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.95ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 71.6MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.44ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 66.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1271.77ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 60.8MB in the end (delta: 5.9MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2915.82ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 59.9MB in the beginning and 124.3MB in the end (delta: -64.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.43ms. Allocated memory is still 172.0MB. Free memory was 124.3MB in the beginning and 117.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 77]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) [L265] a1 = (((a1 / 5) + 110755) + 220746) [L266] a10 = 1 [L267] a19 = 8 [L269] return -1; VAL [\old(input)=5, \result=-1, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] reach_error() VAL [\old(input)=4, a1=331505, a10=1, a12=0, a19=8, a4=14, input=4, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1112 IncrementalHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 396 mSDtfsCounter, 1112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 12:04:00,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE