./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP --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 eed477ccc68b44369a2767c3ea5b70be7a75a8c2370f374d3c3760022cb8d072 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:10:37,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:10:37,492 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:10:37,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:10:37,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:10:37,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:10:37,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:10:37,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:10:37,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:10:37,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:10:37,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:10:37,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:10:37,531 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:10:37,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:10:37,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:10:37,533 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:10:37,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:10:37,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:10:37,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:10:37,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:10:37,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:10:37,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:10:37,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:10:37,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:10:37,539 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:10:37,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:10:37,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:10:37,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:10:37,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:37,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:10:37,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:10:37,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:10:37,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:10:37,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:10:37,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:10:37,543 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:10:37,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:10:37,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:10:37,544 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:10:37,545 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/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_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP 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 -> eed477ccc68b44369a2767c3ea5b70be7a75a8c2370f374d3c3760022cb8d072 [2023-11-06 22:10:37,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:10:37,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:10:37,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:10:37,942 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:10:37,943 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:10:37,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-10.i [2023-11-06 22:10:41,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:10:41,339 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:10:41,339 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-10.i [2023-11-06 22:10:41,351 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/data/16b800345/cdec10cd2a0449168193710a34703fcd/FLAG7bfbc6528 [2023-11-06 22:10:41,367 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/data/16b800345/cdec10cd2a0449168193710a34703fcd [2023-11-06 22:10:41,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:10:41,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:41,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:41,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:41,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:41,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:41,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c322c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41, skipping insertion in model container [2023-11-06 22:10:41,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:41,421 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:41,605 WARN L240 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_54b81489-ea64-4f5f-887b-e344ef7f2394/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-10.i[919,932] [2023-11-06 22:10:41,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:41,793 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:41,817 WARN L240 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_54b81489-ea64-4f5f-887b-e344ef7f2394/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-10.i[919,932] [2023-11-06 22:10:41,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:41,908 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:41,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41 WrapperNode [2023-11-06 22:10:41,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:41,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:41,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:41,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:41,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:41,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,020 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 333 [2023-11-06 22:10:42,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:42,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:42,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:42,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:42,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:42,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:42,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:42,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:42,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (1/1) ... [2023-11-06 22:10:42,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:42,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:42,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:10:42,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:10:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:10:42,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:10:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:10:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:42,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:42,310 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:42,312 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:43,058 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:43,076 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:43,077 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:10:43,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:43 BoogieIcfgContainer [2023-11-06 22:10:43,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:43,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:43,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:43,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:43,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:10:41" (1/3) ... [2023-11-06 22:10:43,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bceabba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:43, skipping insertion in model container [2023-11-06 22:10:43,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:41" (2/3) ... [2023-11-06 22:10:43,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bceabba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:43, skipping insertion in model container [2023-11-06 22:10:43,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:43" (3/3) ... [2023-11-06 22:10:43,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-10.i [2023-11-06 22:10:43,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:43,113 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:10:43,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:43,187 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@793a7da8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:43,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:10:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-06 22:10:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2023-11-06 22:10:43,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:43,216 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 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, 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, 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] [2023-11-06 22:10:43,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:43,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash -779853991, now seen corresponding path program 1 times [2023-11-06 22:10:43,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127169062] [2023-11-06 22:10:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:43,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127169062] [2023-11-06 22:10:43,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-11-06 22:10:43,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843915183] [2023-11-06 22:10:43,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:43,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:43,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:43,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:43,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:10:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:43,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:10:43,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2023-11-06 22:10:44,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843915183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:44,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729163687] [2023-11-06 22:10:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:44,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:10:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:10:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:10:44,079 INFO L87 Difference]: Start difference. First operand has 139 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-11-06 22:10:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:44,131 INFO L93 Difference]: Finished difference Result 271 states and 490 transitions. [2023-11-06 22:10:44,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:10:44,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2023-11-06 22:10:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:44,144 INFO L225 Difference]: With dead ends: 271 [2023-11-06 22:10:44,144 INFO L226 Difference]: Without dead ends: 135 [2023-11-06 22:10:44,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:10:44,153 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:44,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:10:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-06 22:10:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-06 22:10:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-06 22:10:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 217 transitions. [2023-11-06 22:10:44,228 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 217 transitions. Word has length 295 [2023-11-06 22:10:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:44,228 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 217 transitions. [2023-11-06 22:10:44,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2023-11-06 22:10:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 217 transitions. [2023-11-06 22:10:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2023-11-06 22:10:44,238 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:44,238 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 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, 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, 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] [2023-11-06 22:10:44,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:44,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-06 22:10:44,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:44,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash 640999777, now seen corresponding path program 1 times [2023-11-06 22:10:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:44,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479527697] [2023-11-06 22:10:44,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:44,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:44,560 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:10:44,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147731776] [2023-11-06 22:10:44,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:44,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:44,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:44,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:44,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:10:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:44,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:10:44,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-11-06 22:10:45,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:45,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:45,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479527697] [2023-11-06 22:10:45,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:10:45,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147731776] [2023-11-06 22:10:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147731776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:45,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:45,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029195487] [2023-11-06 22:10:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:45,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:45,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:45,453 INFO L87 Difference]: Start difference. First operand 135 states and 217 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-06 22:10:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:10:45,831 INFO L93 Difference]: Finished difference Result 400 states and 646 transitions. [2023-11-06 22:10:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2023-11-06 22:10:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:10:45,851 INFO L225 Difference]: With dead ends: 400 [2023-11-06 22:10:45,851 INFO L226 Difference]: Without dead ends: 268 [2023-11-06 22:10:45,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:10:45,858 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 192 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:10:45,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 840 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:10:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-06 22:10:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 216. [2023-11-06 22:10:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 117 states have internal predecessors, (153), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-11-06 22:10:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 345 transitions. [2023-11-06 22:10:45,921 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 345 transitions. Word has length 295 [2023-11-06 22:10:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:10:45,923 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 345 transitions. [2023-11-06 22:10:45,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-06 22:10:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 345 transitions. [2023-11-06 22:10:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2023-11-06 22:10:45,929 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:10:45,930 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 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, 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, 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] [2023-11-06 22:10:45,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 22:10:46,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:46,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:10:46,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:46,138 INFO L85 PathProgramCache]: Analyzing trace with hash -353545231, now seen corresponding path program 1 times [2023-11-06 22:10:46,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:46,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645190658] [2023-11-06 22:10:46,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:46,287 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:10:46,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250540898] [2023-11-06 22:10:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:10:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:46,294 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:10:46,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54b81489-ea64-4f5f-887b-e344ef7f2394/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:10:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:46,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-06 22:10:46,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1939 proven. 636 refuted. 0 times theorem prover too weak. 1937 trivial. 0 not checked. [2023-11-06 22:11:02,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:42,795 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 237 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:12:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2023-11-06 22:12:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645190658] [2023-11-06 22:12:43,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 22:12:43,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250540898] [2023-11-06 22:12:43,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250540898] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:43,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:12:43,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [35] total 48 [2023-11-06 22:12:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18830647] [2023-11-06 22:12:43,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:43,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:12:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:12:43,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1785, Unknown=4, NotChecked=0, Total=2256 [2023-11-06 22:12:43,094 INFO L87 Difference]: Start difference. First operand 216 states and 345 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2023-11-06 22:13:29,869 WARN L293 SmtUtils]: Spent 37.68s on a formula simplification. DAG size of input: 323 DAG size of output: 322 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:13:31,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:13:36,115 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_~var_1_6~0 65536)) (.cse17 (mod c_~var_1_5~0 65536)) (.cse83 (mod c_~var_1_4~0 65536)) (.cse4 (* 65535 c_~var_1_5~0)) (.cse84 (* c_~var_1_6~0 65535)) (.cse82 (mod c_~var_1_16~0 65536))) (let ((.cse13 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse0 (< c_~var_1_13~0 (+ 2 .cse82))) (.cse12 (mod (+ .cse4 .cse84 56892) 65536)) (.cse7 (< .cse83 56893)) (.cse9 (mod (+ .cse4 .cse84 c_~var_1_4~0) 65536)) (.cse2 (< 56892 .cse83)) (.cse15 (+ .cse17 1)) (.cse14 (let ((.cse81 (+ .cse17 c_~var_1_11~0))) (and (or (< .cse81 (+ .cse82 1)) (< (+ (* 65536 (div (+ (* (- 1) .cse17) .cse83) 65536)) c_~var_1_13~0 .cse17) .cse83)) (or (< .cse82 .cse81) (< (+ (* 65536 (div (+ (* (- 1) .cse82) .cse83 c_~var_1_11~0) 65536)) c_~var_1_13~0 .cse82) (+ .cse83 c_~var_1_11~0)))))) (.cse18 (< (mod c_~var_1_11~0 4294967296) .cse10))) (and (or .cse0 (let ((.cse11 (mod c_~var_1_7~0 65536))) (let ((.cse8 (< .cse10 (+ .cse11 1))) (.cse3 (mod c_~var_1_1~0 65536))) (and (or (let ((.cse5 (* 65535 c_~var_1_7~0))) (let ((.cse1 (< .cse11 .cse10)) (.cse6 (= .cse3 (mod (+ .cse4 .cse5 56892) 65536)))) (and (or .cse1 .cse2 (= .cse3 (mod (+ .cse4 c_~var_1_4~0 .cse5) 65536))) (or (and (or .cse6 .cse1 .cse7) (or .cse2 .cse8)) (= .cse3 .cse9)) (or (and .cse6 (<= .cse10 .cse11)) (= .cse3 .cse12) .cse7)))) .cse13 .cse14) (or (not .cse13) (let ((.cse16 (= .cse3 .cse17))) (and (or (< .cse11 .cse15) .cse16 .cse8) (or (< .cse10 .cse15) (< .cse17 .cse11) .cse16))) .cse14)))) .cse18) (or .cse13 .cse0 (let ((.cse30 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 65536))) (let ((.cse25 (mod (+ .cse4 56892) 65536)) (.cse26 (< .cse10 1)) (.cse19 (< .cse30 .cse15)) (.cse22 (+ 65536 .cse17))) (and (or (= .cse12 .cse17) (and (or .cse19 (forall ((v_z_91 Int) (v_y_91 Int)) (let ((.cse23 (* v_z_91 65535)) (.cse24 (* 65536 v_y_91))) (let ((.cse21 (+ .cse23 .cse25 .cse24)) (.cse20 (+ .cse23 .cse24))) (or (< 65535 .cse20) (= .cse21 .cse22) (< .cse17 v_z_91) (< v_z_91 0) (= .cse21 .cse17) (< .cse20 0)))))) (or .cse19 .cse26) (or (forall ((v_y_86 Int) (v_z_86 Int)) (let ((.cse27 (* 65536 v_y_86)) (.cse28 (* v_z_86 65535))) (let ((.cse29 (+ .cse27 .cse25 .cse28))) (or (< v_z_86 0) (< .cse17 v_z_86) (< (+ .cse27 .cse28) 0) (< 65535 .cse29) (= .cse17 .cse29))))) .cse19) (forall ((v_y_89 Int) (v_z_89 Int)) (let ((.cse33 (* 65536 v_y_89)) (.cse34 (* v_z_89 65535))) (let ((.cse31 (+ .cse33 .cse34)) (.cse32 (+ .cse33 .cse25 .cse34))) (or (< .cse30 (+ v_z_89 1)) (< 65535 .cse31) (= .cse32 .cse22) (< .cse31 0) (< v_z_89 .cse15) (= .cse17 .cse32))))) (forall ((v_z_87 Int) (v_y_87 Int)) (let ((.cse35 (* v_z_87 65535)) (.cse36 (* 65536 v_y_87))) (let ((.cse37 (+ .cse35 .cse25 .cse36))) (or (< (+ .cse35 .cse36) 0) (< v_z_87 .cse15) (= .cse37 .cse17) (< 65535 .cse37) (< .cse30 (+ v_z_87 1)))))) (forall ((v_z_94 Int) (v_y_94 Int)) (let ((.cse39 (* 65536 v_y_94)) (.cse40 (* v_z_94 65535))) (let ((.cse38 (+ .cse39 .cse40 .cse25))) (or (< v_z_94 .cse15) (= .cse38 .cse22) (< .cse30 (+ v_z_94 1)) (< 65535 (+ .cse39 .cse40)) (< .cse38 65536))))) (or .cse19 (forall ((v_z_92 Int) (v_y_92 Int)) (let ((.cse41 (* 65536 v_y_92)) (.cse42 (* v_z_92 65535))) (let ((.cse43 (+ .cse41 .cse25 .cse42))) (or (< 65535 (+ .cse41 .cse42)) (= .cse43 .cse22) (< .cse17 v_z_92) (< .cse43 65536) (< v_z_92 0))))))) .cse7) (or (and (or (and (forall ((v_z_69 Int)) (let ((.cse44 (+ v_z_69 .cse25))) (or (< 65535 v_z_69) (= .cse44 .cse22) (forall ((v_y_69 Int)) (let ((.cse46 (* 65536 v_y_69)) (.cse47 (* v_z_69 65535))) (let ((.cse45 (+ .cse46 .cse47))) (or (< .cse45 .cse10) (< .cse30 (+ .cse46 1 .cse47)) (< .cse45 .cse15))))) (= .cse44 .cse17) (< v_z_69 0)))) (forall ((v_z_69 Int)) (let ((.cse48 (+ v_z_69 .cse25))) (or (< 65535 v_z_69) (= .cse48 .cse22) (forall ((v_y_69 Int)) (let ((.cse50 (* 65536 v_y_69)) (.cse51 (* v_z_69 65535))) (let ((.cse49 (+ .cse50 .cse51))) (or (< .cse49 .cse10) (< .cse30 (+ .cse50 1 .cse51)) (< .cse49 .cse15))))) (< .cse48 65536)))) (or .cse19 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse52 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse53 (+ v_z_69 .cse25))) (or (< 65535 v_z_69) (< .cse17 .cse52) (= .cse53 .cse22) (< .cse52 .cse10) (< .cse53 65536))))) (or .cse19 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse54 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse55 (+ v_z_69 .cse25))) (or (< .cse17 .cse54) (< .cse54 .cse10) (= .cse55 .cse17) (< v_z_69 0) (< 65535 .cse55))))) (forall ((v_z_69 Int)) (let ((.cse59 (+ v_z_69 .cse25))) (or (forall ((v_y_69 Int)) (let ((.cse57 (* 65536 v_y_69)) (.cse58 (* v_z_69 65535))) (let ((.cse56 (+ .cse57 .cse58))) (or (< .cse56 .cse10) (< .cse30 (+ .cse57 1 .cse58)) (< .cse56 .cse15))))) (= .cse59 .cse17) (< v_z_69 0) (< 65535 .cse59)))) (or .cse19 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse60 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse61 (+ v_z_69 .cse25))) (or (< 65535 v_z_69) (< .cse17 .cse60) (= .cse61 .cse22) (< .cse60 .cse10) (= .cse61 .cse17) (< v_z_69 0)))))) .cse7) (or .cse19 .cse26 .cse2)) (= .cse9 .cse17)) (or (let ((.cse66 (mod (+ .cse4 c_~var_1_4~0) 65536))) (and (forall ((v_z_78 Int)) (let ((.cse62 (+ v_z_78 .cse66))) (or (= .cse62 .cse17) (forall ((v_y_78 Int)) (let ((.cse64 (* v_z_78 65535)) (.cse65 (* 65536 v_y_78))) (let ((.cse63 (+ .cse64 .cse65))) (or (< .cse63 .cse15) (< .cse30 (+ .cse64 .cse65 1)) (< .cse63 .cse10))))) (< 65535 .cse62) (< v_z_78 0)))) (or .cse19 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse67 (+ v_z_78 .cse66)) (.cse68 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (= .cse67 .cse17) (< 65535 .cse67) (< v_z_78 0) (< .cse17 .cse68) (< .cse68 .cse10))))) (or .cse19 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse69 (+ v_z_78 .cse66)) (.cse70 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (= .cse69 .cse17) (< 65535 v_z_78) (< v_z_78 0) (< .cse17 .cse70) (= .cse69 .cse22) (< .cse70 .cse10))))) (forall ((v_z_78 Int)) (let ((.cse74 (+ v_z_78 .cse66))) (or (forall ((v_y_78 Int)) (let ((.cse72 (* v_z_78 65535)) (.cse73 (* 65536 v_y_78))) (let ((.cse71 (+ .cse72 .cse73))) (or (< .cse71 .cse15) (< .cse30 (+ .cse72 .cse73 1)) (< .cse71 .cse10))))) (< .cse74 65536) (< 65535 v_z_78) (= .cse74 .cse22)))) (forall ((v_z_78 Int)) (let ((.cse75 (+ v_z_78 .cse66))) (or (= .cse75 .cse17) (forall ((v_y_78 Int)) (let ((.cse77 (* v_z_78 65535)) (.cse78 (* 65536 v_y_78))) (let ((.cse76 (+ .cse77 .cse78))) (or (< .cse76 .cse15) (< .cse30 (+ .cse77 .cse78 1)) (< .cse76 .cse10))))) (< 65535 v_z_78) (< v_z_78 0) (= .cse75 .cse22)))) (or .cse19 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse79 (+ v_z_78 .cse66)) (.cse80 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (< .cse79 65536) (< 65535 v_z_78) (< .cse17 .cse80) (= .cse79 .cse22) (< .cse80 .cse10))))))) .cse2)))) .cse14 .cse18)))) is different from false [2023-11-06 22:13:37,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:13:39,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:13:44,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:13:46,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:13:48,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:13:51,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:13:53,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:14:03,494 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_5~0 65536))) (let ((.cse33 (mod c_~var_1_6~0 65536)) (.cse85 (* c_~var_1_6~0 65535)) (.cse73 (mod c_~var_1_4~0 65536)) (.cse84 (+ .cse3 c_~var_1_11~0)) (.cse1 (mod c_~var_1_16~0 65536)) (.cse71 (* 65535 c_~var_1_5~0))) (let ((.cse18 (+ .cse3 1)) (.cse56 (mod (+ .cse71 c_~var_1_4~0) 65536)) (.cse72 (< .cse84 (+ .cse1 1))) (.cse50 (< 56892 .cse73)) (.cse51 (mod (+ .cse71 .cse85 c_~var_1_4~0) 65536)) (.cse2 (mod (+ .cse71 .cse85 56892) 65536)) (.cse30 (< .cse73 56893)) (.cse0 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse74 (< .cse1 .cse84)) (.cse75 (< (mod c_~var_1_11~0 4294967296) .cse33))) (and (or .cse0 (< c_~var_1_13~0 (+ 2 .cse1)) (let ((.cse15 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 65536))) (let ((.cse10 (mod (+ .cse71 56892) 65536)) (.cse11 (< .cse33 1)) (.cse4 (< .cse15 .cse18)) (.cse7 (+ 65536 .cse3))) (and (or (= .cse2 .cse3) (and (or .cse4 (forall ((v_z_91 Int) (v_y_91 Int)) (let ((.cse8 (* v_z_91 65535)) (.cse9 (* 65536 v_y_91))) (let ((.cse6 (+ .cse8 .cse10 .cse9)) (.cse5 (+ .cse8 .cse9))) (or (< 65535 .cse5) (= .cse6 .cse7) (< .cse3 v_z_91) (< v_z_91 0) (= .cse6 .cse3) (< .cse5 0)))))) (or .cse4 .cse11) (or (forall ((v_y_86 Int) (v_z_86 Int)) (let ((.cse12 (* 65536 v_y_86)) (.cse13 (* v_z_86 65535))) (let ((.cse14 (+ .cse12 .cse10 .cse13))) (or (< v_z_86 0) (< .cse3 v_z_86) (< (+ .cse12 .cse13) 0) (< 65535 .cse14) (= .cse3 .cse14))))) .cse4) (forall ((v_y_89 Int) (v_z_89 Int)) (let ((.cse19 (* 65536 v_y_89)) (.cse20 (* v_z_89 65535))) (let ((.cse16 (+ .cse19 .cse20)) (.cse17 (+ .cse19 .cse10 .cse20))) (or (< .cse15 (+ v_z_89 1)) (< 65535 .cse16) (= .cse17 .cse7) (< .cse16 0) (< v_z_89 .cse18) (= .cse3 .cse17))))) (forall ((v_z_87 Int) (v_y_87 Int)) (let ((.cse21 (* v_z_87 65535)) (.cse22 (* 65536 v_y_87))) (let ((.cse23 (+ .cse21 .cse10 .cse22))) (or (< (+ .cse21 .cse22) 0) (< v_z_87 .cse18) (= .cse23 .cse3) (< 65535 .cse23) (< .cse15 (+ v_z_87 1)))))) (forall ((v_z_94 Int) (v_y_94 Int)) (let ((.cse25 (* 65536 v_y_94)) (.cse26 (* v_z_94 65535))) (let ((.cse24 (+ .cse25 .cse26 .cse10))) (or (< v_z_94 .cse18) (= .cse24 .cse7) (< .cse15 (+ v_z_94 1)) (< 65535 (+ .cse25 .cse26)) (< .cse24 65536))))) (or .cse4 (forall ((v_z_92 Int) (v_y_92 Int)) (let ((.cse27 (* 65536 v_y_92)) (.cse28 (* v_z_92 65535))) (let ((.cse29 (+ .cse27 .cse10 .cse28))) (or (< 65535 (+ .cse27 .cse28)) (= .cse29 .cse7) (< .cse3 v_z_92) (< .cse29 65536) (< v_z_92 0))))))) .cse30) (or (and (or (and (forall ((v_z_69 Int)) (let ((.cse31 (+ v_z_69 .cse10))) (or (< 65535 v_z_69) (= .cse31 .cse7) (forall ((v_y_69 Int)) (let ((.cse34 (* 65536 v_y_69)) (.cse35 (* v_z_69 65535))) (let ((.cse32 (+ .cse34 .cse35))) (or (< .cse32 .cse33) (< .cse15 (+ .cse34 1 .cse35)) (< .cse32 .cse18))))) (= .cse31 .cse3) (< v_z_69 0)))) (forall ((v_z_69 Int)) (let ((.cse36 (+ v_z_69 .cse10))) (or (< 65535 v_z_69) (= .cse36 .cse7) (forall ((v_y_69 Int)) (let ((.cse38 (* 65536 v_y_69)) (.cse39 (* v_z_69 65535))) (let ((.cse37 (+ .cse38 .cse39))) (or (< .cse37 .cse33) (< .cse15 (+ .cse38 1 .cse39)) (< .cse37 .cse18))))) (< .cse36 65536)))) (or .cse4 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse40 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse41 (+ v_z_69 .cse10))) (or (< 65535 v_z_69) (< .cse3 .cse40) (= .cse41 .cse7) (< .cse40 .cse33) (< .cse41 65536))))) (or .cse4 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse42 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse43 (+ v_z_69 .cse10))) (or (< .cse3 .cse42) (< .cse42 .cse33) (= .cse43 .cse3) (< v_z_69 0) (< 65535 .cse43))))) (forall ((v_z_69 Int)) (let ((.cse47 (+ v_z_69 .cse10))) (or (forall ((v_y_69 Int)) (let ((.cse45 (* 65536 v_y_69)) (.cse46 (* v_z_69 65535))) (let ((.cse44 (+ .cse45 .cse46))) (or (< .cse44 .cse33) (< .cse15 (+ .cse45 1 .cse46)) (< .cse44 .cse18))))) (= .cse47 .cse3) (< v_z_69 0) (< 65535 .cse47)))) (or .cse4 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse48 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse49 (+ v_z_69 .cse10))) (or (< 65535 v_z_69) (< .cse3 .cse48) (= .cse49 .cse7) (< .cse48 .cse33) (= .cse49 .cse3) (< v_z_69 0)))))) .cse30) (or .cse4 .cse11 .cse50)) (= .cse51 .cse3)) (or (and (forall ((v_z_78 Int)) (let ((.cse52 (+ v_z_78 .cse56))) (or (= .cse52 .cse3) (forall ((v_y_78 Int)) (let ((.cse54 (* v_z_78 65535)) (.cse55 (* 65536 v_y_78))) (let ((.cse53 (+ .cse54 .cse55))) (or (< .cse53 .cse18) (< .cse15 (+ .cse54 .cse55 1)) (< .cse53 .cse33))))) (< 65535 .cse52) (< v_z_78 0)))) (or .cse4 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse57 (+ v_z_78 .cse56)) (.cse58 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (= .cse57 .cse3) (< 65535 .cse57) (< v_z_78 0) (< .cse3 .cse58) (< .cse58 .cse33))))) (or .cse4 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse59 (+ v_z_78 .cse56)) (.cse60 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (= .cse59 .cse3) (< 65535 v_z_78) (< v_z_78 0) (< .cse3 .cse60) (= .cse59 .cse7) (< .cse60 .cse33))))) (forall ((v_z_78 Int)) (let ((.cse64 (+ v_z_78 .cse56))) (or (forall ((v_y_78 Int)) (let ((.cse62 (* v_z_78 65535)) (.cse63 (* 65536 v_y_78))) (let ((.cse61 (+ .cse62 .cse63))) (or (< .cse61 .cse18) (< .cse15 (+ .cse62 .cse63 1)) (< .cse61 .cse33))))) (< .cse64 65536) (< 65535 v_z_78) (= .cse64 .cse7)))) (forall ((v_z_78 Int)) (let ((.cse65 (+ v_z_78 .cse56))) (or (= .cse65 .cse3) (forall ((v_y_78 Int)) (let ((.cse67 (* v_z_78 65535)) (.cse68 (* 65536 v_y_78))) (let ((.cse66 (+ .cse67 .cse68))) (or (< .cse66 .cse18) (< .cse15 (+ .cse67 .cse68 1)) (< .cse66 .cse33))))) (< 65535 v_z_78) (< v_z_78 0) (= .cse65 .cse7)))) (or .cse4 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse69 (+ v_z_78 .cse56)) (.cse70 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (< .cse69 65536) (< 65535 v_z_78) (< .cse3 .cse70) (= .cse69 .cse7) (< .cse70 .cse33)))))) .cse50)))) (and (or .cse72 (< (+ (* 65536 (div (+ (* (- 1) .cse3) .cse73) 65536)) c_~var_1_13~0 .cse3) .cse73)) (or .cse74 (< (+ (* 65536 (div (+ (* (- 1) .cse1) .cse73 c_~var_1_11~0) 65536)) c_~var_1_13~0 .cse1) (+ .cse73 c_~var_1_11~0)))) .cse75) (let ((.cse76 (mod c_~var_1_14~0 65536))) (or (< c_~var_1_13~0 .cse76) (let ((.cse77 (mod c_~var_1_7~0 65536))) (let ((.cse79 (< .cse33 (+ .cse77 1))) (.cse80 (mod c_~var_1_1~0 65536))) (and (or (not .cse0) (let ((.cse78 (= .cse80 .cse3))) (and (or (< .cse77 .cse18) .cse78 .cse79) (or (< .cse33 .cse18) (< .cse3 .cse77) .cse78)))) (or (= .cse56 .cse76) .cse72) (= 1 (mod c_~var_1_8~0 256)) (or (let ((.cse82 (* 65535 c_~var_1_7~0))) (let ((.cse81 (< .cse77 .cse33)) (.cse83 (= .cse80 (mod (+ .cse71 .cse82 56892) 65536)))) (and (or .cse81 .cse50 (= .cse80 (mod (+ .cse71 c_~var_1_4~0 .cse82) 65536))) (or (and (or .cse83 .cse81 .cse30) (or .cse50 .cse79)) (= .cse80 .cse51)) (or (and .cse83 (<= .cse33 .cse77)) (= .cse80 .cse2) .cse30)))) .cse0) (or .cse74 (= .cse76 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))))) (< c_~var_1_13~0 (+ |c_ULTIMATE.start_step_#t~nondet4#1| 1)) (= (mod c_~var_1_9~0 256) 0) .cse75)))))) is different from false [2023-11-06 22:14:09,188 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 120 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:14:16,869 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_5~0 65536))) (let ((.cse33 (mod c_~var_1_6~0 65536)) (.cse85 (* c_~var_1_6~0 65535)) (.cse73 (mod c_~var_1_4~0 65536)) (.cse84 (+ .cse3 c_~var_1_11~0)) (.cse1 (mod c_~var_1_16~0 65536)) (.cse71 (* 65535 c_~var_1_5~0))) (let ((.cse18 (+ .cse3 1)) (.cse56 (mod (+ .cse71 c_~var_1_4~0) 65536)) (.cse72 (< .cse84 (+ .cse1 1))) (.cse50 (< 56892 .cse73)) (.cse51 (mod (+ .cse71 .cse85 c_~var_1_4~0) 65536)) (.cse2 (mod (+ .cse71 .cse85 56892) 65536)) (.cse30 (< .cse73 56893)) (.cse0 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse74 (< .cse1 .cse84)) (.cse75 (< (mod c_~var_1_11~0 4294967296) .cse33))) (and (or .cse0 (< c_~var_1_13~0 (+ 2 .cse1)) (let ((.cse15 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 65536))) (let ((.cse10 (mod (+ .cse71 56892) 65536)) (.cse11 (< .cse33 1)) (.cse4 (< .cse15 .cse18)) (.cse7 (+ 65536 .cse3))) (and (or (= .cse2 .cse3) (and (or .cse4 (forall ((v_z_91 Int) (v_y_91 Int)) (let ((.cse8 (* v_z_91 65535)) (.cse9 (* 65536 v_y_91))) (let ((.cse6 (+ .cse8 .cse10 .cse9)) (.cse5 (+ .cse8 .cse9))) (or (< 65535 .cse5) (= .cse6 .cse7) (< .cse3 v_z_91) (< v_z_91 0) (= .cse6 .cse3) (< .cse5 0)))))) (or .cse4 .cse11) (or (forall ((v_y_86 Int) (v_z_86 Int)) (let ((.cse12 (* 65536 v_y_86)) (.cse13 (* v_z_86 65535))) (let ((.cse14 (+ .cse12 .cse10 .cse13))) (or (< v_z_86 0) (< .cse3 v_z_86) (< (+ .cse12 .cse13) 0) (< 65535 .cse14) (= .cse3 .cse14))))) .cse4) (forall ((v_y_89 Int) (v_z_89 Int)) (let ((.cse19 (* 65536 v_y_89)) (.cse20 (* v_z_89 65535))) (let ((.cse16 (+ .cse19 .cse20)) (.cse17 (+ .cse19 .cse10 .cse20))) (or (< .cse15 (+ v_z_89 1)) (< 65535 .cse16) (= .cse17 .cse7) (< .cse16 0) (< v_z_89 .cse18) (= .cse3 .cse17))))) (forall ((v_z_87 Int) (v_y_87 Int)) (let ((.cse21 (* v_z_87 65535)) (.cse22 (* 65536 v_y_87))) (let ((.cse23 (+ .cse21 .cse10 .cse22))) (or (< (+ .cse21 .cse22) 0) (< v_z_87 .cse18) (= .cse23 .cse3) (< 65535 .cse23) (< .cse15 (+ v_z_87 1)))))) (forall ((v_z_94 Int) (v_y_94 Int)) (let ((.cse25 (* 65536 v_y_94)) (.cse26 (* v_z_94 65535))) (let ((.cse24 (+ .cse25 .cse26 .cse10))) (or (< v_z_94 .cse18) (= .cse24 .cse7) (< .cse15 (+ v_z_94 1)) (< 65535 (+ .cse25 .cse26)) (< .cse24 65536))))) (or .cse4 (forall ((v_z_92 Int) (v_y_92 Int)) (let ((.cse27 (* 65536 v_y_92)) (.cse28 (* v_z_92 65535))) (let ((.cse29 (+ .cse27 .cse10 .cse28))) (or (< 65535 (+ .cse27 .cse28)) (= .cse29 .cse7) (< .cse3 v_z_92) (< .cse29 65536) (< v_z_92 0))))))) .cse30) (or (and (or (and (forall ((v_z_69 Int)) (let ((.cse31 (+ v_z_69 .cse10))) (or (< 65535 v_z_69) (= .cse31 .cse7) (forall ((v_y_69 Int)) (let ((.cse34 (* 65536 v_y_69)) (.cse35 (* v_z_69 65535))) (let ((.cse32 (+ .cse34 .cse35))) (or (< .cse32 .cse33) (< .cse15 (+ .cse34 1 .cse35)) (< .cse32 .cse18))))) (= .cse31 .cse3) (< v_z_69 0)))) (forall ((v_z_69 Int)) (let ((.cse36 (+ v_z_69 .cse10))) (or (< 65535 v_z_69) (= .cse36 .cse7) (forall ((v_y_69 Int)) (let ((.cse38 (* 65536 v_y_69)) (.cse39 (* v_z_69 65535))) (let ((.cse37 (+ .cse38 .cse39))) (or (< .cse37 .cse33) (< .cse15 (+ .cse38 1 .cse39)) (< .cse37 .cse18))))) (< .cse36 65536)))) (or .cse4 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse40 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse41 (+ v_z_69 .cse10))) (or (< 65535 v_z_69) (< .cse3 .cse40) (= .cse41 .cse7) (< .cse40 .cse33) (< .cse41 65536))))) (or .cse4 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse42 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse43 (+ v_z_69 .cse10))) (or (< .cse3 .cse42) (< .cse42 .cse33) (= .cse43 .cse3) (< v_z_69 0) (< 65535 .cse43))))) (forall ((v_z_69 Int)) (let ((.cse47 (+ v_z_69 .cse10))) (or (forall ((v_y_69 Int)) (let ((.cse45 (* 65536 v_y_69)) (.cse46 (* v_z_69 65535))) (let ((.cse44 (+ .cse45 .cse46))) (or (< .cse44 .cse33) (< .cse15 (+ .cse45 1 .cse46)) (< .cse44 .cse18))))) (= .cse47 .cse3) (< v_z_69 0) (< 65535 .cse47)))) (or .cse4 (forall ((v_z_69 Int) (v_y_69 Int)) (let ((.cse48 (+ (* 65536 v_y_69) (* v_z_69 65535))) (.cse49 (+ v_z_69 .cse10))) (or (< 65535 v_z_69) (< .cse3 .cse48) (= .cse49 .cse7) (< .cse48 .cse33) (= .cse49 .cse3) (< v_z_69 0)))))) .cse30) (or .cse4 .cse11 .cse50)) (= .cse51 .cse3)) (or (and (forall ((v_z_78 Int)) (let ((.cse52 (+ v_z_78 .cse56))) (or (= .cse52 .cse3) (forall ((v_y_78 Int)) (let ((.cse54 (* v_z_78 65535)) (.cse55 (* 65536 v_y_78))) (let ((.cse53 (+ .cse54 .cse55))) (or (< .cse53 .cse18) (< .cse15 (+ .cse54 .cse55 1)) (< .cse53 .cse33))))) (< 65535 .cse52) (< v_z_78 0)))) (or .cse4 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse57 (+ v_z_78 .cse56)) (.cse58 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (= .cse57 .cse3) (< 65535 .cse57) (< v_z_78 0) (< .cse3 .cse58) (< .cse58 .cse33))))) (or .cse4 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse59 (+ v_z_78 .cse56)) (.cse60 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (= .cse59 .cse3) (< 65535 v_z_78) (< v_z_78 0) (< .cse3 .cse60) (= .cse59 .cse7) (< .cse60 .cse33))))) (forall ((v_z_78 Int)) (let ((.cse64 (+ v_z_78 .cse56))) (or (forall ((v_y_78 Int)) (let ((.cse62 (* v_z_78 65535)) (.cse63 (* 65536 v_y_78))) (let ((.cse61 (+ .cse62 .cse63))) (or (< .cse61 .cse18) (< .cse15 (+ .cse62 .cse63 1)) (< .cse61 .cse33))))) (< .cse64 65536) (< 65535 v_z_78) (= .cse64 .cse7)))) (forall ((v_z_78 Int)) (let ((.cse65 (+ v_z_78 .cse56))) (or (= .cse65 .cse3) (forall ((v_y_78 Int)) (let ((.cse67 (* v_z_78 65535)) (.cse68 (* 65536 v_y_78))) (let ((.cse66 (+ .cse67 .cse68))) (or (< .cse66 .cse18) (< .cse15 (+ .cse67 .cse68 1)) (< .cse66 .cse33))))) (< 65535 v_z_78) (< v_z_78 0) (= .cse65 .cse7)))) (or .cse4 (forall ((v_y_78 Int) (v_z_78 Int)) (let ((.cse69 (+ v_z_78 .cse56)) (.cse70 (+ (* v_z_78 65535) (* 65536 v_y_78)))) (or (< .cse69 65536) (< 65535 v_z_78) (< .cse3 .cse70) (= .cse69 .cse7) (< .cse70 .cse33)))))) .cse50)))) (and (or .cse72 (< (+ (* 65536 (div (+ (* (- 1) .cse3) .cse73) 65536)) c_~var_1_13~0 .cse3) .cse73)) (or .cse74 (< (+ (* 65536 (div (+ (* (- 1) .cse1) .cse73 c_~var_1_11~0) 65536)) c_~var_1_13~0 .cse1) (+ .cse73 c_~var_1_11~0)))) .cse75) (let ((.cse80 (mod c_~var_1_14~0 65536))) (or (let ((.cse76 (mod c_~var_1_7~0 65536))) (let ((.cse78 (< .cse33 (+ .cse76 1))) (.cse79 (mod c_~var_1_1~0 65536))) (and (or (not .cse0) (let ((.cse77 (= .cse79 .cse3))) (and (or (< .cse76 .cse18) .cse77 .cse78) (or (< .cse33 .cse18) (< .cse3 .cse76) .cse77)))) (or (= .cse56 .cse80) .cse72) (= 1 (mod c_~var_1_8~0 256)) (or (let ((.cse82 (* 65535 c_~var_1_7~0))) (let ((.cse81 (< .cse76 .cse33)) (.cse83 (= .cse79 (mod (+ .cse71 .cse82 56892) 65536)))) (and (or .cse81 .cse50 (= .cse79 (mod (+ .cse71 c_~var_1_4~0 .cse82) 65536))) (or (and (or .cse83 .cse81 .cse30) (or .cse50 .cse78)) (= .cse79 .cse51)) (or (and .cse83 (<= .cse33 .cse76)) (= .cse79 .cse2) .cse30)))) .cse0) (or .cse74 (= .cse80 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))))) (< |c_ULTIMATE.start_step_~stepLocal_4~0#1| .cse80) (= (mod c_~var_1_9~0 256) 0) .cse75)))))) is different from false [2023-11-06 22:14:19,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:14:21,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:14:29,514 WARN L293 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 148 DAG size of output: 147 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:14:31,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1]