./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ae1eacd45e2434e505261d43bb17259916099964617682d271ef41fa1c24d0c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:42:47,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:42:47,933 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:42:47,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:42:47,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:42:47,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:42:47,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:42:47,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:42:47,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:42:47,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:42:47,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:42:47,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:42:47,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:42:47,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:42:47,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:42:47,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:42:47,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:42:47,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:42:47,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:42:47,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:42:47,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:42:47,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:42:47,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:42:47,992 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:42:47,993 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:42:47,993 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:42:47,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:42:47,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:42:47,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:42:47,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:42:47,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:42:47,995 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:42:47,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:42:47,995 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Kojak 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 -> 9ae1eacd45e2434e505261d43bb17259916099964617682d271ef41fa1c24d0c [2024-11-09 00:42:48,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:42:48,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:42:48,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:42:48,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:42:48,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:42:48,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c Unable to find full path for "g++" [2024-11-09 00:42:50,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:42:50,548 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:42:50,548 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c [2024-11-09 00:42:50,556 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/data/d3034774d/bd358f54b9424d53a7b2ab8a319205ec/FLAG0e57fcc54 [2024-11-09 00:42:50,570 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/data/d3034774d/bd358f54b9424d53a7b2ab8a319205ec [2024-11-09 00:42:50,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:42:50,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:42:50,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:42:50,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:42:50,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:42:50,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218abd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50, skipping insertion in model container [2024-11-09 00:42:50,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:42:50,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c[1060,1073] [2024-11-09 00:42:50,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:42:50,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:42:50,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c[1060,1073] [2024-11-09 00:42:50,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:42:50,886 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:42:50,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50 WrapperNode [2024-11-09 00:42:50,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:42:50,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:42:50,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:42:50,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:42:50,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,928 INFO L138 Inliner]: procedures = 16, calls = 59, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2024-11-09 00:42:50,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:42:50,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:42:50,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:42:50,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:42:50,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:42:50,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:42:50,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:42:50,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:42:50,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:42:50" (1/1) ... [2024-11-09 00:42:50,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:42:50,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:42:50,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:42:50,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4ef5f65e-14ad-421e-8640-90f1b1fcae07/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:42:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:42:51,020 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:42:51,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:42:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:42:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 00:42:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_33_to_42_0 [2024-11-09 00:42:51,021 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_33_to_42_0 [2024-11-09 00:42:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 00:42:51,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:42:51,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:42:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 00:42:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 00:42:51,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 00:42:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 00:42:51,100 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:42:51,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:42:51,330 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-09 00:42:51,330 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:42:51,447 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:42:51,447 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:42:51,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:42:51 BoogieIcfgContainer [2024-11-09 00:42:51,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:42:51,451 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:42:51,451 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:42:51,462 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:42:51,462 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:42:51" (1/1) ... [2024-11-09 00:42:51,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:42:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 26 states and 31 transitions. [2024-11-09 00:42:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-09 00:42:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:42:51,536 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:42:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:51,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-09 00:42:51,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:42:52,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 00:42:52,107 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 00:42:52,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-09 00:42:52,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:42:52,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:42:52,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 37 [2024-11-09 00:42:52,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 41 [2024-11-09 00:42:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:42:55,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-09 00:42:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 31 states and 39 transitions. [2024-11-09 00:42:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-09 00:42:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:42:56,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:42:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:56,811 WARN L253 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-09 00:42:56,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:42:56,841 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 00:42:56,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-09 00:42:56,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 00:43:51,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:43:51,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:43:51,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 48 [2024-11-09 00:44:33,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:44:33,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:44:33,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 166 [2024-11-09 00:44:33,541 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 00:44:33,546 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 295 [2024-11-09 00:44:33,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 103 [2024-11-09 00:44:33,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 81 [2024-11-09 00:44:33,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 00:44:33,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 00:44:36,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:44:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:44:36,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:44:36,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:44:36,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:44:36,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:44:36,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 142 [2024-11-09 00:44:36,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2024-11-09 00:44:37,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-09 00:44:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:45:56,779 WARN L286 SmtUtils]: Spent 10.33s on a formula simplification. DAG size of input: 54 DAG size of output: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:47:16,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 00:47:18,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 00:47:19,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 00:47:25,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 00:47:26,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 00:47:44,404 WARN L286 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 98 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:48:02,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 00:48:04,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 00:48:40,142 WARN L286 SmtUtils]: Spent 9.10s on a formula simplification. DAG size of input: 98 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:49:45,445 WARN L286 SmtUtils]: Spent 9.79s on a formula simplification. DAG size of input: 59 DAG size of output: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:49:56,836 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 61 DAG size of output: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:50:13,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 00:50:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:50:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 44 states and 75 transitions. [2024-11-09 00:50:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 75 transitions. [2024-11-09 00:50:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:50:13,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:50:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:50:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:50:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:50:14,403 WARN L253 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 135 conjuncts are in the unsatisfiable core [2024-11-09 00:50:14,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:50:14,429 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 00:50:14,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2024-11-09 00:50:14,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 00:50:28,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:50:28,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:50:28,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 48 [2024-11-09 00:50:50,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:50:50,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:50:50,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 166 [2024-11-09 00:50:50,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 70 [2024-11-09 00:50:50,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-09 00:50:50,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 00:50:50,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 00:50:50,482 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 00:50:50,485 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 354 [2024-11-09 00:51:40,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:51:40,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:51:40,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:51:40,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:51:40,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:51:40,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 00:51:40,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 335 treesize of output 223 [2024-11-09 00:51:40,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2024-11-09 00:51:40,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 72 [2024-11-09 00:51:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:52:30,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse24 (select (select |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~v.base) c_func_to_recursive_line_33_to_42_0_~v.offset)) (.cse6 (select (select |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~u.base) c_func_to_recursive_line_33_to_42_0_~u.offset))) (let ((.cse0 (not (= c_func_to_recursive_line_33_to_42_0_~u.base c_func_to_recursive_line_33_to_42_0_~v.base))) (.cse3 (= (mod (+ .cse6 1) 2) 0)) (.cse5 (select (select |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~A.base) c_func_to_recursive_line_33_to_42_0_~A.offset)) (.cse9 (= .cse24 3)) (.cse8 (* (- 1) .cse6)) (.cse4 (select (select |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~r.base) c_func_to_recursive_line_33_to_42_0_~r.offset)) (.cse13 (= .cse24 1)) (.cse1 (not (= c_func_to_recursive_line_33_to_42_0_~r.base c_func_to_recursive_line_33_to_42_0_~v.base))) (.cse2 (not (= c_func_to_recursive_line_33_to_42_0_~A.base c_func_to_recursive_line_33_to_42_0_~r.base))) (.cse14 (not (= c_func_to_recursive_line_33_to_42_0_~r.base c_func_to_recursive_line_33_to_42_0_~u.base))) (.cse15 (not (= c_func_to_recursive_line_33_to_42_0_~A.base c_func_to_recursive_line_33_to_42_0_~v.base))) (.cse16 (not (= c_func_to_recursive_line_33_to_42_0_~A.base c_func_to_recursive_line_33_to_42_0_~u.base)))) (and (not (and .cse0 .cse1 .cse2 (or (and .cse3 (= (+ .cse4 .cse5 .cse6 1) (let ((.cse7 (div (+ (- 1) .cse8) 2))) (* .cse7 .cse7))) (<= 0 .cse4) .cse9 (<= (+ .cse4 4) .cse6)) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~u.base v_DerPreprocessor_1) c_func_to_recursive_line_33_to_42_0_~r.base v_DerPreprocessor_2) c_func_to_recursive_line_33_to_42_0_~v.base v_DerPreprocessor_3))) (let ((.cse10 (select (select .cse12 c_func_to_recursive_line_33_to_42_0_~r.base) c_func_to_recursive_line_33_to_42_0_~r.offset))) (and (<= (+ .cse10 1) 0) (= (+ .cse4 1) (+ .cse6 .cse10)) (= 3 (select v_DerPreprocessor_3 c_func_to_recursive_line_33_to_42_0_~v.offset)) (= (let ((.cse11 (div (+ (* (- 1) .cse4) .cse10) 2))) (* .cse11 .cse11)) (+ .cse4 (select (select .cse12 c_func_to_recursive_line_33_to_42_0_~A.base) c_func_to_recursive_line_33_to_42_0_~A.offset))) (<= (+ 5 (* 2 .cse10)) .cse4) (= .cse4 (+ .cse10 1 (select (select .cse12 c_func_to_recursive_line_33_to_42_0_~u.base) c_func_to_recursive_line_33_to_42_0_~u.offset))) (= (mod (+ .cse4 .cse10) 2) 0))))) .cse13)) .cse14 .cse15 .cse16)) .cse0 (or (let ((.cse17 (let ((.cse18 (div (+ .cse8 1) 2))) (* .cse18 .cse18)))) (and (<= (+ .cse5 1) .cse17) .cse3 (= (+ .cse4 .cse5 1) .cse17) (<= (+ 3 .cse17) (+ .cse5 .cse6)) .cse9)) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~u.base v_DerPreprocessor_4) c_func_to_recursive_line_33_to_42_0_~r.base v_DerPreprocessor_5) c_func_to_recursive_line_33_to_42_0_~v.base v_DerPreprocessor_6))) (let ((.cse21 (select (select .cse22 c_func_to_recursive_line_33_to_42_0_~u.base) c_func_to_recursive_line_33_to_42_0_~u.offset))) (let ((.cse19 (let ((.cse23 (div (+ (* (- 1) .cse21) 1) 2))) (* .cse23 .cse23))) (.cse20 (select (select .cse22 c_func_to_recursive_line_33_to_42_0_~A.base) c_func_to_recursive_line_33_to_42_0_~A.offset))) (and (<= .cse19 .cse20) (= 3 (select v_DerPreprocessor_6 c_func_to_recursive_line_33_to_42_0_~v.offset)) (= (+ 2 .cse21) .cse6) (= (+ .cse20 (select (select .cse22 c_func_to_recursive_line_33_to_42_0_~r.base) c_func_to_recursive_line_33_to_42_0_~r.offset) 1) .cse19) (= (mod (+ .cse21 1) 2) 0) (= (+ .cse4 .cse20) (+ .cse21 .cse19)) (<= (+ 3 .cse19) (+ .cse21 .cse20))))))) .cse13)) .cse1 .cse2 .cse14 .cse15 .cse16))) is different from false [2024-11-09 00:54:39,729 WARN L286 SmtUtils]: Spent 1.43m on a formula simplification. DAG size of input: 140 DAG size of output: 89 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:54:39,749 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse24 (select (select |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~v.base) c_func_to_recursive_line_33_to_42_0_~v.offset)) (.cse6 (select (select |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~u.base) c_func_to_recursive_line_33_to_42_0_~u.offset))) (let ((.cse0 (not (= c_func_to_recursive_line_33_to_42_0_~u.base c_func_to_recursive_line_33_to_42_0_~v.base))) (.cse3 (= (mod (+ .cse6 1) 2) 0)) (.cse5 (select (select |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~A.base) c_func_to_recursive_line_33_to_42_0_~A.offset)) (.cse9 (= .cse24 3)) (.cse8 (* (- 1) .cse6)) (.cse4 (select (select |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~r.base) c_func_to_recursive_line_33_to_42_0_~r.offset)) (.cse13 (= .cse24 1)) (.cse1 (not (= c_func_to_recursive_line_33_to_42_0_~r.base c_func_to_recursive_line_33_to_42_0_~v.base))) (.cse2 (not (= c_func_to_recursive_line_33_to_42_0_~A.base c_func_to_recursive_line_33_to_42_0_~r.base))) (.cse14 (not (= c_func_to_recursive_line_33_to_42_0_~r.base c_func_to_recursive_line_33_to_42_0_~u.base))) (.cse15 (not (= c_func_to_recursive_line_33_to_42_0_~A.base c_func_to_recursive_line_33_to_42_0_~v.base))) (.cse16 (not (= c_func_to_recursive_line_33_to_42_0_~A.base c_func_to_recursive_line_33_to_42_0_~u.base)))) (and (not (and .cse0 .cse1 .cse2 (or (and .cse3 (= (+ .cse4 .cse5 .cse6 1) (let ((.cse7 (div (+ (- 1) .cse8) 2))) (* .cse7 .cse7))) (<= 0 .cse4) .cse9 (<= (+ .cse4 4) .cse6)) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~u.base v_DerPreprocessor_1) c_func_to_recursive_line_33_to_42_0_~r.base v_DerPreprocessor_2) c_func_to_recursive_line_33_to_42_0_~v.base v_DerPreprocessor_3))) (let ((.cse10 (select (select .cse12 c_func_to_recursive_line_33_to_42_0_~r.base) c_func_to_recursive_line_33_to_42_0_~r.offset))) (and (<= (+ .cse10 1) 0) (= (+ .cse4 1) (+ .cse6 .cse10)) (= 3 (select v_DerPreprocessor_3 c_func_to_recursive_line_33_to_42_0_~v.offset)) (= (let ((.cse11 (div (+ (* (- 1) .cse4) .cse10) 2))) (* .cse11 .cse11)) (+ .cse4 (select (select .cse12 c_func_to_recursive_line_33_to_42_0_~A.base) c_func_to_recursive_line_33_to_42_0_~A.offset))) (<= (+ 5 (* 2 .cse10)) .cse4) (= .cse4 (+ .cse10 1 (select (select .cse12 c_func_to_recursive_line_33_to_42_0_~u.base) c_func_to_recursive_line_33_to_42_0_~u.offset))) (= (mod (+ .cse4 .cse10) 2) 0))))) .cse13)) .cse14 .cse15 .cse16)) .cse0 (or (let ((.cse17 (let ((.cse18 (div (+ .cse8 1) 2))) (* .cse18 .cse18)))) (and (<= (+ .cse5 1) .cse17) .cse3 (= (+ .cse4 .cse5 1) .cse17) (<= (+ 3 .cse17) (+ .cse5 .cse6)) .cse9)) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| c_func_to_recursive_line_33_to_42_0_~u.base v_DerPreprocessor_4) c_func_to_recursive_line_33_to_42_0_~r.base v_DerPreprocessor_5) c_func_to_recursive_line_33_to_42_0_~v.base v_DerPreprocessor_6))) (let ((.cse21 (select (select .cse22 c_func_to_recursive_line_33_to_42_0_~u.base) c_func_to_recursive_line_33_to_42_0_~u.offset))) (let ((.cse19 (let ((.cse23 (div (+ (* (- 1) .cse21) 1) 2))) (* .cse23 .cse23))) (.cse20 (select (select .cse22 c_func_to_recursive_line_33_to_42_0_~A.base) c_func_to_recursive_line_33_to_42_0_~A.offset))) (and (<= .cse19 .cse20) (= 3 (select v_DerPreprocessor_6 c_func_to_recursive_line_33_to_42_0_~v.offset)) (= (+ 2 .cse21) .cse6) (= (+ .cse20 (select (select .cse22 c_func_to_recursive_line_33_to_42_0_~r.base) c_func_to_recursive_line_33_to_42_0_~r.offset) 1) .cse19) (= (mod (+ .cse21 1) 2) 0) (= (+ .cse4 .cse20) (+ .cse21 .cse19)) (<= (+ 3 .cse19) (+ .cse21 .cse20))))))) .cse13)) .cse1 .cse2 .cse14 .cse15 .cse16)))) is different from true [2024-11-09 00:54:50,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~u.base|) |c_func_to_recursive_line_33_to_42_0_#in~u.offset|)) (.cse22 (select (select |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~v.base|) |c_func_to_recursive_line_33_to_42_0_#in~v.offset|))) (let ((.cse11 (= 3 .cse22)) (.cse6 (* (- 1) .cse3)) (.cse0 (not (= |c_func_to_recursive_line_33_to_42_0_#in~v.base| |c_func_to_recursive_line_33_to_42_0_#in~u.base|))) (.cse4 (select (select |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~A.base|) |c_func_to_recursive_line_33_to_42_0_#in~A.offset|)) (.cse1 (select (select |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~r.base|) |c_func_to_recursive_line_33_to_42_0_#in~r.offset|)) (.cse2 (not (= |c_func_to_recursive_line_33_to_42_0_#in~r.base| |c_func_to_recursive_line_33_to_42_0_#in~A.base|))) (.cse7 (not (= |c_func_to_recursive_line_33_to_42_0_#in~v.base| |c_func_to_recursive_line_33_to_42_0_#in~r.base|))) (.cse8 (not (= |c_func_to_recursive_line_33_to_42_0_#in~v.base| |c_func_to_recursive_line_33_to_42_0_#in~A.base|))) (.cse9 (not (= |c_func_to_recursive_line_33_to_42_0_#in~r.base| |c_func_to_recursive_line_33_to_42_0_#in~u.base|))) (.cse10 (not (= |c_func_to_recursive_line_33_to_42_0_#in~u.base| |c_func_to_recursive_line_33_to_42_0_#in~A.base|))) (.cse12 (= (mod (+ .cse3 1) 2) 0)) (.cse20 (= .cse22 1))) (and .cse0 (not (and .cse0 (<= 0 .cse1) .cse2 (= (+ .cse3 .cse4 .cse1 1) (let ((.cse5 (div (+ (- 1) .cse6) 2))) (* .cse5 .cse5))) .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ .cse1 4) .cse3) .cse12)) .cse2 .cse7 .cse8 .cse9 .cse10 (or (let ((.cse13 (let ((.cse14 (div (+ .cse6 1) 2))) (* .cse14 .cse14)))) (and (<= (+ .cse4 1) .cse13) (= (+ .cse4 .cse1 1) .cse13) .cse11 (<= (+ 3 .cse13) (+ .cse3 .cse4)) .cse12)) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~u.base| v_DerPreprocessor_4) |c_func_to_recursive_line_33_to_42_0_#in~r.base| v_DerPreprocessor_5) |c_func_to_recursive_line_33_to_42_0_#in~v.base| v_DerPreprocessor_6))) (let ((.cse17 (select (select .cse18 |c_func_to_recursive_line_33_to_42_0_#in~u.base|) |c_func_to_recursive_line_33_to_42_0_#in~u.offset|))) (let ((.cse16 (select (select .cse18 |c_func_to_recursive_line_33_to_42_0_#in~A.base|) |c_func_to_recursive_line_33_to_42_0_#in~A.offset|)) (.cse15 (let ((.cse19 (div (+ (* (- 1) .cse17) 1) 2))) (* .cse19 .cse19)))) (and (<= (+ 3 .cse15) (+ .cse16 .cse17)) (= (mod (+ .cse17 1) 2) 0) (= .cse3 (+ .cse17 2)) (<= .cse15 .cse16) (= .cse15 (+ .cse16 (select (select .cse18 |c_func_to_recursive_line_33_to_42_0_#in~r.base|) |c_func_to_recursive_line_33_to_42_0_#in~r.offset|) 1)) (= (select v_DerPreprocessor_6 |c_func_to_recursive_line_33_to_42_0_#in~v.offset|) 3) (= (+ .cse16 .cse1) (+ .cse17 .cse15))))))) .cse20)) (not (and .cse0 (= (+ .cse4 .cse1) (let ((.cse21 (div (+ (- 1) .cse3) 2))) (* .cse21 .cse21))) .cse2 .cse7 .cse8 .cse9 .cse10 .cse12 .cse20))))) is different from false [2024-11-09 00:55:41,362 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select (select |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~u.base|) |c_func_to_recursive_line_33_to_42_0_#in~u.offset|)) (.cse22 (select (select |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~v.base|) |c_func_to_recursive_line_33_to_42_0_#in~v.offset|))) (let ((.cse11 (= 3 .cse22)) (.cse6 (* (- 1) .cse3)) (.cse0 (not (= |c_func_to_recursive_line_33_to_42_0_#in~v.base| |c_func_to_recursive_line_33_to_42_0_#in~u.base|))) (.cse4 (select (select |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~A.base|) |c_func_to_recursive_line_33_to_42_0_#in~A.offset|)) (.cse1 (select (select |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~r.base|) |c_func_to_recursive_line_33_to_42_0_#in~r.offset|)) (.cse2 (not (= |c_func_to_recursive_line_33_to_42_0_#in~r.base| |c_func_to_recursive_line_33_to_42_0_#in~A.base|))) (.cse7 (not (= |c_func_to_recursive_line_33_to_42_0_#in~v.base| |c_func_to_recursive_line_33_to_42_0_#in~r.base|))) (.cse8 (not (= |c_func_to_recursive_line_33_to_42_0_#in~v.base| |c_func_to_recursive_line_33_to_42_0_#in~A.base|))) (.cse9 (not (= |c_func_to_recursive_line_33_to_42_0_#in~r.base| |c_func_to_recursive_line_33_to_42_0_#in~u.base|))) (.cse10 (not (= |c_func_to_recursive_line_33_to_42_0_#in~u.base| |c_func_to_recursive_line_33_to_42_0_#in~A.base|))) (.cse12 (= (mod (+ .cse3 1) 2) 0)) (.cse20 (= .cse22 1))) (and .cse0 (not (and .cse0 (<= 0 .cse1) .cse2 (= (+ .cse3 .cse4 .cse1 1) (let ((.cse5 (div (+ (- 1) .cse6) 2))) (* .cse5 .cse5))) .cse7 .cse8 .cse9 .cse10 .cse11 (<= (+ .cse1 4) .cse3) .cse12)) .cse2 .cse7 .cse8 .cse9 .cse10 (or (let ((.cse13 (let ((.cse14 (div (+ .cse6 1) 2))) (* .cse14 .cse14)))) (and (<= (+ .cse4 1) .cse13) (= (+ .cse4 .cse1 1) .cse13) .cse11 (<= (+ 3 .cse13) (+ .cse3 .cse4)) .cse12)) (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_42_0_#in~u.base| v_DerPreprocessor_4) |c_func_to_recursive_line_33_to_42_0_#in~r.base| v_DerPreprocessor_5) |c_func_to_recursive_line_33_to_42_0_#in~v.base| v_DerPreprocessor_6))) (let ((.cse17 (select (select .cse18 |c_func_to_recursive_line_33_to_42_0_#in~u.base|) |c_func_to_recursive_line_33_to_42_0_#in~u.offset|))) (let ((.cse16 (select (select .cse18 |c_func_to_recursive_line_33_to_42_0_#in~A.base|) |c_func_to_recursive_line_33_to_42_0_#in~A.offset|)) (.cse15 (let ((.cse19 (div (+ (* (- 1) .cse17) 1) 2))) (* .cse19 .cse19)))) (and (<= (+ 3 .cse15) (+ .cse16 .cse17)) (= (mod (+ .cse17 1) 2) 0) (= .cse3 (+ .cse17 2)) (<= .cse15 .cse16) (= .cse15 (+ .cse16 (select (select .cse18 |c_func_to_recursive_line_33_to_42_0_#in~r.base|) |c_func_to_recursive_line_33_to_42_0_#in~r.offset|) 1)) (= (select v_DerPreprocessor_6 |c_func_to_recursive_line_33_to_42_0_#in~v.offset|) 3) (= (+ .cse16 .cse1) (+ .cse17 .cse15))))))) .cse20)) (not (and .cse0 (= (+ .cse4 .cse1) (let ((.cse21 (div (+ (- 1) .cse3) 2))) (* .cse21 .cse21))) .cse2 .cse7 .cse8 .cse9 .cse10 .cse12 .cse20)))))) is different from true [2024-11-09 00:56:15,143 WARN L286 SmtUtils]: Spent 16.81s on a formula simplification. DAG size of input: 108 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 00:57:21,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-09 00:57:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:57:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 46 states and 84 transitions. [2024-11-09 00:57:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2024-11-09 00:57:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:57:25,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:57:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:57:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:57:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:57:26,627 WARN L253 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 149 conjuncts are in the unsatisfiable core [2024-11-09 00:57:26,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:57:26,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 00:57:26,658 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 00:57:26,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34