./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:31:28,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:31:28,357 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:31:28,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:31:28,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:31:28,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:31:28,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:31:28,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:31:28,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:31:28,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:31:28,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:31:28,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:31:28,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:31:28,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:31:28,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:31:28,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:31:28,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:31:28,402 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:31:28,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:31:28,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:31:28,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:31:28,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:31:28,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:31:28,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:31:28,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:31:28,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:31:28,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:31:28,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:31:28,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:31:28,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:31:28,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:31:28,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:31:28,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:31:28,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:31:28,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:31:28,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:31:28,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:31:28,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:31:28,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:31:28,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:31:28,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:31:28,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:31:28,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd 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 -> 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2024-11-13 14:31:28,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:31:28,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:31:28,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:31:28,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:31:28,783 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:31:28,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i Unable to find full path for "g++" [2024-11-13 14:31:31,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:31:31,556 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:31:31,557 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-11-13 14:31:31,570 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/data/99a9fe952/62b392b7b46444d3b7aa511e77722067/FLAGd15ac86ca [2024-11-13 14:31:31,586 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/data/99a9fe952/62b392b7b46444d3b7aa511e77722067 [2024-11-13 14:31:31,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:31:31,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:31:31,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:31:31,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:31:31,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:31:31,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:31,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb4dd68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31, skipping insertion in model container [2024-11-13 14:31:31,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:31,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:31:31,794 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_93434240-f56d-4cc8-a030-f46a1eaa5a45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2024-11-13 14:31:31,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:31:31,854 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:31:31,866 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_93434240-f56d-4cc8-a030-f46a1eaa5a45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2024-11-13 14:31:31,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:31:31,910 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:31:31,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31 WrapperNode [2024-11-13 14:31:31,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:31:31,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:31:31,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:31:31,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:31:31,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:31,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:31,977 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-13 14:31:31,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:31:31,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:31:31,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:31:31,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:31:32,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,041 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:31:32,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:31:32,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:31:32,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:31:32,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:31:32,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (1/1) ... [2024-11-13 14:31:32,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:31:32,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:31:32,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:31:32,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:31:32,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:31:32,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:31:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:31:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:31:32,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:31:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:31:32,301 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:31:32,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:31:32,719 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-13 14:31:32,719 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:31:32,736 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:31:32,738 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:31:32,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:32 BoogieIcfgContainer [2024-11-13 14:31:32,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:31:32,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:31:32,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:31:32,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:31:32,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:31:31" (1/3) ... [2024-11-13 14:31:32,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dced9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:31:32, skipping insertion in model container [2024-11-13 14:31:32,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:31" (2/3) ... [2024-11-13 14:31:32,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dced9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:31:32, skipping insertion in model container [2024-11-13 14:31:32,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:32" (3/3) ... [2024-11-13 14:31:32,755 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-11-13 14:31:32,774 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:31:32,776 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:31:32,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:31:32,867 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@e480db0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:31:32,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:31:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 14:31:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 14:31:32,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:32,883 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:32,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:32,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1526359180, now seen corresponding path program 1 times [2024-11-13 14:31:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116407256] [2024-11-13 14:31:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:31:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:31:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:31:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:31:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:31:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 14:31:33,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:33,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116407256] [2024-11-13 14:31:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116407256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:33,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:33,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:31:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628053130] [2024-11-13 14:31:33,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:33,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:31:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:31:33,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:31:33,347 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 14:31:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:33,388 INFO L93 Difference]: Finished difference Result 119 states and 195 transitions. [2024-11-13 14:31:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:31:33,390 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-11-13 14:31:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:33,397 INFO L225 Difference]: With dead ends: 119 [2024-11-13 14:31:33,397 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 14:31:33,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:31:33,405 INFO L432 NwaCegarLoop]: 88 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, 88 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 [2024-11-13 14:31:33,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:31:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 14:31:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 14:31:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 14:31:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2024-11-13 14:31:33,449 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 106 [2024-11-13 14:31:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:33,450 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2024-11-13 14:31:33,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 14:31:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2024-11-13 14:31:33,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 14:31:33,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:33,455 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:33,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:31:33,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:33,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash 662536716, now seen corresponding path program 1 times [2024-11-13 14:31:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085426131] [2024-11-13 14:31:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:31:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:31:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:31:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:31:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:31:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 14:31:34,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:34,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085426131] [2024-11-13 14:31:34,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085426131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:34,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:34,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:31:34,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681633849] [2024-11-13 14:31:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:34,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:31:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:31:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:31:34,511 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:31:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:34,940 INFO L93 Difference]: Finished difference Result 166 states and 247 transitions. [2024-11-13 14:31:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:31:34,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-11-13 14:31:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:34,945 INFO L225 Difference]: With dead ends: 166 [2024-11-13 14:31:34,945 INFO L226 Difference]: Without dead ends: 112 [2024-11-13 14:31:34,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:31:34,950 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:34,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 199 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:31:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-13 14:31:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2024-11-13 14:31:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 14:31:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-11-13 14:31:34,992 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 106 [2024-11-13 14:31:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:34,992 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-11-13 14:31:34,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:31:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-11-13 14:31:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:31:34,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:34,995 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:34,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:31:34,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:34,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:34,996 INFO L85 PathProgramCache]: Analyzing trace with hash -317674954, now seen corresponding path program 1 times [2024-11-13 14:31:34,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:34,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865571133] [2024-11-13 14:31:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:34,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:31:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:31:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:31:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:31:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:31:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 14:31:35,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:35,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865571133] [2024-11-13 14:31:35,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865571133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:35,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:31:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106301956] [2024-11-13 14:31:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:35,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:31:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:35,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:31:35,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:31:35,590 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:31:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:35,754 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2024-11-13 14:31:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:31:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-13 14:31:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:35,759 INFO L225 Difference]: With dead ends: 188 [2024-11-13 14:31:35,762 INFO L226 Difference]: Without dead ends: 125 [2024-11-13 14:31:35,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:31:35,764 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:35,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 169 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:31:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-13 14:31:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2024-11-13 14:31:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 14:31:35,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-11-13 14:31:35,794 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 110 [2024-11-13 14:31:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:35,795 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-11-13 14:31:35,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:31:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-11-13 14:31:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 14:31:35,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:35,800 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:35,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:31:35,801 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:35,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1038092201, now seen corresponding path program 1 times [2024-11-13 14:31:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:35,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102966086] [2024-11-13 14:31:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 14:31:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:31:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:31:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:31:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:31:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 14:31:37,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:37,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102966086] [2024-11-13 14:31:37,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102966086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:37,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:37,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:31:37,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627768363] [2024-11-13 14:31:37,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:37,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:31:37,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:37,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:31:37,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:31:37,268 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:31:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:37,613 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-13 14:31:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:31:37,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 111 [2024-11-13 14:31:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:37,616 INFO L225 Difference]: With dead ends: 192 [2024-11-13 14:31:37,616 INFO L226 Difference]: Without dead ends: 125 [2024-11-13 14:31:37,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:31:37,618 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:37,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 193 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:31:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-13 14:31:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2024-11-13 14:31:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 82 states have internal predecessors, (105), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 14:31:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-11-13 14:31:37,662 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 111 [2024-11-13 14:31:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:37,663 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-11-13 14:31:37,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:31:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-13 14:31:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:31:37,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:37,668 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:37,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:31:37,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:37,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:37,669 INFO L85 PathProgramCache]: Analyzing trace with hash -77414563, now seen corresponding path program 1 times [2024-11-13 14:31:37,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:31:37,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038238189] [2024-11-13 14:31:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:31:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:31:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832237371] [2024-11-13 14:31:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:37,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:31:37,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:31:37,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:31:37,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:31:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:31:37,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:31:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:31:38,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:31:38,127 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:31:38,128 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:31:38,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:31:38,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:31:38,334 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-13 14:31:38,456 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:31:38,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:31:38 BoogieIcfgContainer [2024-11-13 14:31:38,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:31:38,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:31:38,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:31:38,466 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:31:38,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:32" (3/4) ... [2024-11-13 14:31:38,470 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:31:38,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:31:38,472 INFO L158 Benchmark]: Toolchain (without parser) took 6881.33ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 78.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-13 14:31:38,473 INFO L158 Benchmark]: CDTParser took 1.41ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:31:38,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.45ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 80.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:31:38,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.22ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:31:38,478 INFO L158 Benchmark]: Boogie Preprocessor took 102.02ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:31:38,478 INFO L158 Benchmark]: RCFGBuilder took 657.92ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 58.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:31:38,478 INFO L158 Benchmark]: TraceAbstraction took 5723.57ms. Allocated memory is still 117.4MB. Free memory was 58.2MB in the beginning and 78.5MB in the end (delta: -20.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:31:38,478 INFO L158 Benchmark]: Witness Printer took 5.61ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 78.4MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:31:38,480 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41ms. Allocated memory is still 117.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.45ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 80.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.22ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.02ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 657.92ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 58.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5723.57ms. Allocated memory is still 117.4MB. Free memory was 58.2MB in the beginning and 78.5MB in the end (delta: -20.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.61ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 78.4MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of bitwiseOr at line 99, overapproximation of bitwiseOr at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_6 = 32; [L24] signed short int var_1_7 = 18477; [L25] signed short int var_1_8 = 5; [L26] float var_1_9 = 100.8; [L27] unsigned long int var_1_10 = 256; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 10; [L30] unsigned long int var_1_13 = 1879106797; [L31] unsigned long int var_1_14 = 1581421231; [L32] signed long int var_1_15 = -32; [L33] unsigned long int last_1_var_1_10 = 256; [L34] signed long int last_1_var_1_15 = -32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L103] isInitial = 1 [L104] FCALL initially() [L105] int k_loop; [L106] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L106] COND TRUE k_loop < 1 [L107] CALL updateLastVariables() [L95] last_1_var_1_10 = var_1_10 [L96] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_6 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L72] var_1_7 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L73] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L75] var_1_8 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L77] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L77] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L78] var_1_9 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L80] var_1_11 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L81] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L82] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L82] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L87] var_1_13 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L88] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L89] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L89] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L90] var_1_14 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_14 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L91] RET assume_abort_if_not(var_1_14 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L92] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L92] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L108] RET updateVariables() [L109] CALL step() [L38] unsigned long int stepLocal_1 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L39] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L39] unsigned long int stepLocal_0 = last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))); [L40] COND FALSE !(stepLocal_0 != last_1_var_1_10) [L45] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L47] signed short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, var_1_10=256, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L48] COND FALSE !(\read(var_1_11)) [L55] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L57] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L58] COND FALSE !(var_1_1 <= var_1_9) [L65] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L109] RET step() [L110] CALL, EXPR property() [L99] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L99-L100] return ((((last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))) != last_1_var_1_10) ? ((last_1_var_1_10 == (var_1_6 - (var_1_7 - var_1_8))) ? (var_1_1 == ((float) var_1_9)) : 1) : (var_1_1 == ((float) var_1_9))) && (var_1_11 ? (((var_1_7 % var_1_12) >= var_1_6) ? (var_1_10 == ((unsigned long int) ((var_1_13 + var_1_14) - var_1_7))) : (var_1_10 == ((unsigned long int) var_1_12))) : (var_1_10 == ((unsigned long int) var_1_7)))) && ((var_1_1 <= var_1_9) ? ((var_1_10 > (last_1_var_1_15 + (var_1_10 + var_1_7))) ? (var_1_15 == ((signed long int) var_1_7)) : (var_1_15 == ((signed long int) -5))) : (var_1_15 == ((signed long int) var_1_7))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=123, var_1_13=1073741823, var_1_14=1073741824, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 649 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 293 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 1167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:31:38,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:31:41,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:31:42,062 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:31:42,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:31:42,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:31:42,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:31:42,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:31:42,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:31:42,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:31:42,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:31:42,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:31:42,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:31:42,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:31:42,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:31:42,107 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:31:42,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:31:42,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:31:42,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:31:42,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:31:42,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:31:42,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:31:42,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:31:42,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:31:42,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:31:42,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:31:42,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:31:42,109 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:31:42,109 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:31:42,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:31:42,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:31:42,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:31:42,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:31:42,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:31:42,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:31:42,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:31:42,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:31:42,111 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd 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 -> 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2024-11-13 14:31:42,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:31:42,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:31:42,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:31:42,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:31:42,496 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:31:42,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i Unable to find full path for "g++" [2024-11-13 14:31:44,836 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:31:45,220 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:31:45,221 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-11-13 14:31:45,237 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/data/084fc503e/359055a0c7b04fdeafd221a6c9ef6e00/FLAG9ece9be2d [2024-11-13 14:31:45,260 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/data/084fc503e/359055a0c7b04fdeafd221a6c9ef6e00 [2024-11-13 14:31:45,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:31:45,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:31:45,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:31:45,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:31:45,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:31:45,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb22934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45, skipping insertion in model container [2024-11-13 14:31:45,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:31:45,516 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_93434240-f56d-4cc8-a030-f46a1eaa5a45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2024-11-13 14:31:45,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:31:45,623 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:31:45,637 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_93434240-f56d-4cc8-a030-f46a1eaa5a45/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2024-11-13 14:31:45,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:31:45,685 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:31:45,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45 WrapperNode [2024-11-13 14:31:45,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:31:45,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:31:45,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:31:45,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:31:45,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,742 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-13 14:31:45,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:31:45,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:31:45,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:31:45,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:31:45,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,798 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:31:45,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:31:45,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:31:45,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:31:45,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:31:45,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (1/1) ... [2024-11-13 14:31:45,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:31:45,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:31:45,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:31:45,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:31:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:31:45,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:31:45,938 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:31:45,938 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:31:45,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:31:45,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:31:46,083 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:31:46,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:31:46,637 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-13 14:31:46,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:31:46,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:31:46,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:31:46,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:46 BoogieIcfgContainer [2024-11-13 14:31:46,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:31:46,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:31:46,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:31:46,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:31:46,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:31:45" (1/3) ... [2024-11-13 14:31:46,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16993225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:31:46, skipping insertion in model container [2024-11-13 14:31:46,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:31:45" (2/3) ... [2024-11-13 14:31:46,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16993225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:31:46, skipping insertion in model container [2024-11-13 14:31:46,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:31:46" (3/3) ... [2024-11-13 14:31:46,675 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-11-13 14:31:46,699 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:31:46,702 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:31:46,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:31:46,795 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1a0a2497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:31:46,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:31:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 14:31:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 14:31:46,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:46,843 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:46,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:46,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:46,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1811369050, now seen corresponding path program 1 times [2024-11-13 14:31:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:31:46,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401432103] [2024-11-13 14:31:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:46,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:31:46,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:31:46,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:31:46,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 14:31:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:47,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:31:47,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:31:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-11-13 14:31:47,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:31:47,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:31:47,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401432103] [2024-11-13 14:31:47,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401432103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:47,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:47,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:31:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435898745] [2024-11-13 14:31:47,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:47,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:31:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:31:47,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:31:47,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:31:47,215 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 14:31:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:47,252 INFO L93 Difference]: Finished difference Result 99 states and 163 transitions. [2024-11-13 14:31:47,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:31:47,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-13 14:31:47,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:47,264 INFO L225 Difference]: With dead ends: 99 [2024-11-13 14:31:47,264 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 14:31:47,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:31:47,273 INFO L432 NwaCegarLoop]: 72 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, 72 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 [2024-11-13 14:31:47,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:31:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 14:31:47,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-13 14:31:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 14:31:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-13 14:31:47,335 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 102 [2024-11-13 14:31:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:47,336 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-13 14:31:47,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 14:31:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-13 14:31:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-13 14:31:47,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:47,339 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:47,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 14:31:47,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:31:47,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -843673306, now seen corresponding path program 1 times [2024-11-13 14:31:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:31:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756696532] [2024-11-13 14:31:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:47,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:31:47,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:31:47,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:31:47,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 14:31:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:47,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:31:47,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:31:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 14:31:49,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:31:49,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:31:49,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756696532] [2024-11-13 14:31:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756696532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:49,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:49,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:31:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768857218] [2024-11-13 14:31:49,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:49,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:31:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:31:49,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:31:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:31:49,306 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:31:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:49,824 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions. [2024-11-13 14:31:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:31:49,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-11-13 14:31:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:49,831 INFO L225 Difference]: With dead ends: 136 [2024-11-13 14:31:49,832 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 14:31:49,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:31:49,834 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:49,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 204 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:31:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 14:31:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2024-11-13 14:31:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 14:31:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-11-13 14:31:49,893 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 102 [2024-11-13 14:31:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:49,894 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-11-13 14:31:49,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:31:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-11-13 14:31:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:31:49,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:49,900 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:49,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 14:31:50,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:31:50,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1167403971, now seen corresponding path program 1 times [2024-11-13 14:31:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:31:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390315081] [2024-11-13 14:31:50,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:50,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:31:50,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:31:50,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:31:50,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 14:31:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:50,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:31:50,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:31:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 252 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-13 14:31:52,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:31:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-13 14:31:52,930 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:31:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390315081] [2024-11-13 14:31:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390315081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:31:52,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:31:52,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-13 14:31:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795530466] [2024-11-13 14:31:52,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:31:52,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:31:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:31:52,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:31:52,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:31:52,936 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-13 14:31:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:31:54,989 INFO L93 Difference]: Finished difference Result 192 states and 260 transitions. [2024-11-13 14:31:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 14:31:54,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 103 [2024-11-13 14:31:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:31:54,994 INFO L225 Difference]: With dead ends: 192 [2024-11-13 14:31:54,995 INFO L226 Difference]: Without dead ends: 148 [2024-11-13 14:31:54,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:31:55,001 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 152 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:31:55,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 178 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:31:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-13 14:31:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2024-11-13 14:31:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 states have internal predecessors, (78), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 14:31:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2024-11-13 14:31:55,058 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 103 [2024-11-13 14:31:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:31:55,058 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2024-11-13 14:31:55,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-13 14:31:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2024-11-13 14:31:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:31:55,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:31:55,064 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:31:55,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:31:55,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:31:55,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:31:55,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:31:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1847462341, now seen corresponding path program 1 times [2024-11-13 14:31:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:31:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815063167] [2024-11-13 14:31:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:31:55,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:31:55,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:31:55,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:31:55,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 14:31:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:55,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:31:55,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:32:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-13 14:32:06,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:32:06,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:32:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815063167] [2024-11-13 14:32:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815063167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:32:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:32:06,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:32:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74647907] [2024-11-13 14:32:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:32:06,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:32:06,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:32:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:32:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:32:06,888 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:32:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:32:08,617 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2024-11-13 14:32:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:32:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-11-13 14:32:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:32:08,624 INFO L225 Difference]: With dead ends: 162 [2024-11-13 14:32:08,629 INFO L226 Difference]: Without dead ends: 160 [2024-11-13 14:32:08,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:32:08,630 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 66 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:32:08,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 391 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 14:32:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-13 14:32:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 121. [2024-11-13 14:32:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 77 states have internal predecessors, (89), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 14:32:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 165 transitions. [2024-11-13 14:32:08,691 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 165 transitions. Word has length 103 [2024-11-13 14:32:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:32:08,692 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 165 transitions. [2024-11-13 14:32:08,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-13 14:32:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 165 transitions. [2024-11-13 14:32:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:32:08,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:32:08,698 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:32:08,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-13 14:32:08,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:32:08,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:32:08,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:32:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1594224436, now seen corresponding path program 1 times [2024-11-13 14:32:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:32:08,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653029795] [2024-11-13 14:32:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:32:08,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:32:08,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:32:08,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 14:32:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:09,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:32:09,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:32:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-13 14:32:10,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:32:10,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:32:10,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653029795] [2024-11-13 14:32:10,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653029795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:32:10,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238003921] [2024-11-13 14:32:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:10,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:32:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:32:10,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:32:10,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:32:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:10,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:32:10,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:32:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-13 14:32:11,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:32:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238003921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:32:11,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:32:11,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-13 14:32:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512869135] [2024-11-13 14:32:11,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:32:11,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:32:11,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:32:11,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:32:11,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:32:11,581 INFO L87 Difference]: Start difference. First operand 121 states and 165 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 14:32:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:32:12,444 INFO L93 Difference]: Finished difference Result 233 states and 311 transitions. [2024-11-13 14:32:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:32:12,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-13 14:32:12,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:32:12,450 INFO L225 Difference]: With dead ends: 233 [2024-11-13 14:32:12,450 INFO L226 Difference]: Without dead ends: 162 [2024-11-13 14:32:12,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:32:12,452 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 91 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:32:12,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 240 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:32:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-13 14:32:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 130. [2024-11-13 14:32:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 85 states have internal predecessors, (98), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 14:32:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 174 transitions. [2024-11-13 14:32:12,484 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 174 transitions. Word has length 104 [2024-11-13 14:32:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:32:12,484 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 174 transitions. [2024-11-13 14:32:12,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-13 14:32:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 174 transitions. [2024-11-13 14:32:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:32:12,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:32:12,487 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:32:12,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-13 14:32:12,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 14:32:12,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:32:12,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:32:12,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:32:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1596071478, now seen corresponding path program 1 times [2024-11-13 14:32:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:32:12,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851478339] [2024-11-13 14:32:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:12,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:32:12,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:32:12,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:32:12,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93434240-f56d-4cc8-a030-f46a1eaa5a45/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 14:32:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:32:13,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 14:32:13,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:32:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-13 14:32:23,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:44:42,260 WARN L286 SmtUtils]: Spent 5.71m on a formula simplification. DAG size of input: 520 DAG size of output: 493 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:46:14,789 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse73 ((_ sign_extend 16) c_~var_1_7~0))) (let ((.cse0 (bvadd c_~var_1_10~0 c_~last_1_var_1_15~0 .cse73))) (or (bvugt |c_ULTIMATE.start_step_~stepLocal_3~0#1| .cse0) (let ((.cse111 (= (_ bv0 32) (bvadd c_~var_1_10~0 (_ bv5 32))))) (let ((.cse57 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (not (bvsge (bvsrem .cse73 ((_ zero_extend 24) ~var_1_12~0)) ((_ sign_extend 16) ~var_1_6~0))))) (.cse66 (bvugt c_~var_1_10~0 (bvadd c_~var_1_10~0 c_~last_1_var_1_15~0 (_ bv4294967291 32)))) (.cse61 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse149 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse150 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse149) .cse150)) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse150)))))) (not (= c_~var_1_10~0 .cse149)))))) (.cse62 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse147 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse148 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse147) .cse148)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse148))))))) (not (= c_~var_1_10~0 .cse147)))))) (.cse63 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse146 ((_ sign_extend 16) ~var_1_6~0)) (.cse145 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse145) .cse146)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse146)) (= c_~var_1_10~0 .cse145)))) .cse111)) (.cse64 (or .cse111 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse143 ((_ zero_extend 24) ~var_1_12~0)) (.cse144 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse143) .cse144)) (= c_~var_1_10~0 .cse143) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse144)))))))) (.cse37 (or .cse111 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse142 ((_ sign_extend 16) ~var_1_6~0)) (.cse141 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse141) .cse142) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse142)) (= c_~var_1_10~0 .cse141)))))) (.cse38 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse139 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse140 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse139) .cse140) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse140))))))) (not (= c_~var_1_10~0 .cse139)))))) (.cse39 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse137 ((_ zero_extend 24) ~var_1_12~0))) (or (not (= c_~var_1_10~0 .cse137)) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse138 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse137) .cse138) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse138)))))))))) (.cse40 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse135 ((_ zero_extend 24) ~var_1_12~0)) (.cse136 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse135) .cse136) (= c_~var_1_10~0 .cse135) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse136)))))) .cse111)) (.cse36 (fp.eq c_~var_1_1~0 c_~var_1_9~0)) (.cse75 (= c_~var_1_10~0 .cse73))) (let ((.cse27 (or .cse75 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse134 ((_ sign_extend 16) ~var_1_6~0)) (.cse133 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse73 .cse133) .cse134) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse134)) (not (= c_~var_1_10~0 .cse133))))))) (.cse28 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse132 ((_ sign_extend 16) ~var_1_6~0)) (.cse131 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse73 .cse131) .cse132) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse132)) (= c_~var_1_10~0 .cse131)))) .cse75)) (.cse29 (or .cse75 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse130 ((_ sign_extend 16) ~var_1_6~0)) (.cse129 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse73 .cse129) .cse130) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse130))) (= c_~var_1_10~0 .cse129)))))) (.cse32 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse128 ((_ sign_extend 16) ~var_1_6~0)) (.cse127 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse73 .cse127) .cse128) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse128))) (not (= c_~var_1_10~0 .cse127))))) .cse75)) (.cse91 (and .cse37 .cse38 .cse39 .cse40 (or .cse36 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse126 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse126) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse126))))))))) (.cse92 (and .cse37 (or (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse125 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse125) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse125))))))) .cse111) .cse36) .cse38 .cse39 .cse40)) (.cse88 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse124 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse73 ((_ zero_extend 24) ~var_1_12~0)) .cse124) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse124)))))))) (.cse35 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (bvsge (bvsrem .cse73 ((_ zero_extend 24) ~var_1_12~0)) ((_ sign_extend 16) ~var_1_6~0)))) (.cse12 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse123 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse73 ((_ zero_extend 24) ~var_1_12~0)) .cse123) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse123))))))) (.cse106 (not (bvugt c_~var_1_10~0 .cse0))) (.cse34 (= (_ bv0 8) c_~var_1_11~0)) (.cse68 (and .cse61 .cse62 .cse63 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse122 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) ((_ zero_extend 24) ~var_1_12~0)) .cse122)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse122)))))) .cse36) .cse64)) (.cse41 (not .cse66)) (.cse43 (or .cse111 .cse57)) (.cse45 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse121 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse73 ((_ zero_extend 24) ~var_1_12~0)) .cse121)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse121))))))))) (let ((.cse24 (= c_~last_1_var_1_10~0 (bvxor c_~last_1_var_1_10~0 c_~last_1_var_1_10~0))) (.cse8 (= c_~last_1_var_1_10~0 (bvxor c_~last_1_var_1_15~0 c_~last_1_var_1_10~0))) (.cse65 (and .cse43 .cse45)) (.cse67 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse120 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse73 ((_ zero_extend 24) ~var_1_12~0)) .cse120)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse120))))))) (.cse14 (fp.leq c_~var_1_1~0 c_~var_1_9~0)) (.cse51 (or .cse68 .cse41)) (.cse44 (or .cse57 .cse34)) (.cse55 (or .cse75 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse119 ((_ sign_extend 16) ~var_1_6~0)) (.cse118 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse73 .cse118) .cse119)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse119)) (= c_~var_1_10~0 .cse118)))))) (.cse56 (or .cse75 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse117 ((_ sign_extend 16) ~var_1_6~0)) (.cse116 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse73 .cse116) .cse117)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse117))) (= c_~var_1_10~0 .cse116)))))) (.cse58 (or .cse75 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse115 ((_ sign_extend 16) ~var_1_6~0)) (.cse114 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse73 .cse114) .cse115)) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse115))) (not (= c_~var_1_10~0 .cse114))))))) (.cse59 (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse113 ((_ sign_extend 16) ~var_1_6~0)) (.cse112 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse73 .cse112) .cse113)) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse113)) (not (= c_~var_1_10~0 .cse112))))) .cse75)) (.cse60 (or .cse106 .cse57)) (.cse1 (bvugt c_~last_1_var_1_15~0 c_~last_1_var_1_10~0)) (.cse16 (= (_ bv0 32) (bvadd (_ bv5 32) .cse73))) (.cse86 (and (or .cse41 .cse12) (or .cse66 .cse12))) (.cse13 (and .cse88 (or .cse111 .cse35))) (.cse89 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse109 ((_ zero_extend 24) ~var_1_12~0))) (or (= c_~var_1_10~0 .cse109) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse110 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse109) .cse110) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse110)))))))))) (.cse90 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse107 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse108 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem (_ bv4294967291 32) .cse107) .cse108) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse108))))))) (= c_~var_1_10~0 .cse107))))) (.cse20 (or .cse92 .cse41)) (.cse21 (or .cse91 .cse41)) (.cse11 (not .cse34)) (.cse30 (or .cse106 .cse35)) (.cse33 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse105 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse73 .cse105) ((_ sign_extend 16) ~var_1_6~0)) (= c_~var_1_10~0 .cse105))))) (.cse81 (not .cse36)) (.cse26 (and .cse27 .cse28 .cse29 .cse32))) (let ((.cse15 (let ((.cse98 (or .cse81 .cse26))) (and (or .cse36 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_8~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse93 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse73 ((_ zero_extend 24) ~var_1_12~0)) .cse93) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse93)))))) .cse34) (or .cse11 (and (or .cse36 (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse94 ((_ zero_extend 24) ~var_1_12~0)) (.cse95 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse73 .cse94) .cse95) (= c_~var_1_10~0 .cse94) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse95))))))) (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse96 ((_ zero_extend 24) ~var_1_12~0)) (.cse97 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse73 .cse96) .cse97) (not (= c_~var_1_10~0 .cse96)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse97))))))))) .cse98)) (or (and .cse30 (or (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse99 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse73 ((_ zero_extend 24) ~var_1_12~0)) .cse99) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse99))))))) .cse33) .cse36) (or .cse81 .cse33)) .cse34) (or .cse11 (and .cse30 (or (and (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse100 ((_ zero_extend 24) ~var_1_12~0))) (or (= c_~var_1_10~0 .cse100) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse101 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse73 .cse100) .cse101) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse101)))))))))) (or .cse33 .cse75) (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse102 ((_ zero_extend 24) ~var_1_12~0))) (or (bvsge (bvsrem .cse73 .cse102) ((_ sign_extend 16) ~var_1_6~0)) (not (= c_~var_1_10~0 .cse102))))) .cse75) (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse103 ((_ zero_extend 24) ~var_1_12~0))) (or (not (= c_~var_1_10~0 .cse103)) (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse104 ((_ sign_extend 16) ~var_1_6~0))) (or (bvsge (bvsrem .cse73 .cse103) .cse104) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse104))))))))))) .cse36) .cse98))))) (.cse18 (and (or .cse66 .cse91) .cse20 (or .cse66 .cse92) .cse21)) (.cse19 (or .cse66 (and .cse38 .cse89 .cse39 .cse90))) (.cse22 (or .cse66 (and .cse38 .cse89 .cse39 .cse36 .cse90))) (.cse4 (or (let ((.cse87 (and .cse88 .cse33))) (and (or .cse66 .cse87) (or .cse87 .cse41))) .cse34)) (.cse5 (or .cse11 (and (or .cse66 .cse13) (or .cse41 .cse13)))) (.cse6 (or .cse86 .cse11)) (.cse9 (or .cse16 .cse35)) (.cse7 (or .cse86 .cse34)) (.cse3 (not .cse1)) (.cse54 (and (or (and (or (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse74 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse73 .cse74) ((_ sign_extend 16) ~var_1_6~0))) (not (= c_~var_1_10~0 .cse74))))) .cse75) (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse76 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse77 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse73 .cse76) .cse77)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse77))))))) (not (= c_~var_1_10~0 .cse76))))) (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse78 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse79 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse73 .cse78) .cse79)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse79))))))) (= c_~var_1_10~0 .cse78)))) (or .cse75 (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse80 ((_ zero_extend 24) ~var_1_12~0))) (or (not (bvsge (bvsrem .cse73 .cse80) ((_ sign_extend 16) ~var_1_6~0))) (= c_~var_1_10~0 .cse80)))))) .cse36) .cse44 (or (and .cse55 .cse56 .cse58 .cse59) .cse81) (or (and (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse82 ((_ zero_extend 24) ~var_1_12~0)) (.cse83 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse73 .cse82) .cse83)) (= c_~var_1_10~0 .cse82) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse83))))))) (forall ((~var_1_6~0 (_ BitVec 16)) (~var_1_12~0 (_ BitVec 8))) (let ((.cse84 ((_ zero_extend 24) ~var_1_12~0)) (.cse85 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem .cse73 .cse84) .cse85)) (not (= c_~var_1_10~0 .cse84)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) .cse73)) .cse85)))))))) .cse36) .cse60)) (.cse17 (not .cse16)) (.cse52 (or .cse66 (and .cse61 .cse62 (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse69 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse70 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse69) .cse70)) (forall ((~var_1_8~0 (_ BitVec 16))) (not (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse70))))))) (= c_~var_1_10~0 .cse69)))) (forall ((~var_1_12~0 (_ BitVec 8))) (let ((.cse71 ((_ zero_extend 24) ~var_1_12~0))) (or (forall ((~var_1_6~0 (_ BitVec 16))) (let ((.cse72 ((_ sign_extend 16) ~var_1_6~0))) (or (not (bvsge (bvsrem (_ bv4294967291 32) .cse71) .cse72)) (forall ((~var_1_8~0 (_ BitVec 16))) (= c_~last_1_var_1_10~0 (bvadd (bvneg (bvadd (bvneg ((_ sign_extend 16) ~var_1_8~0)) (_ bv4294967291 32))) .cse72)))))) (= c_~var_1_10~0 .cse71))))))) (.cse53 (and .cse51 (or .cse66 .cse68) .cse34)) (.cse23 (not .cse14)) (.cse47 (or .cse66 .cse67)) (.cse42 (or .cse16 .cse57)) (.cse48 (or .cse67 .cse41)) (.cse49 (or .cse66 .cse65)) (.cse10 (not .cse8)) (.cse50 (or .cse65 .cse41)) (.cse25 (not .cse24))) (and (or (and (or (and (or (let ((.cse2 (and .cse4 .cse5 .cse6 .cse7))) (and (or .cse1 .cse2) (or .cse3 .cse2))) .cse8) .cse9 (or .cse10 (and .cse4 (or .cse11 .cse12) (or .cse11 .cse13) .cse7))) .cse14) (or (and (or (and (or .cse15 .cse10) (or .cse8 (and (or .cse15 .cse3) (or .cse1 .cse15)))) .cse16) (or .cse17 (and (or (and (or .cse18 .cse3) (or .cse1 .cse18)) .cse8) (or .cse10 (and .cse19 .cse20 .cse21 .cse22))))) .cse23)) .cse24) (or .cse25 (and (or (and (or .cse16 (and (or .cse15 .cse8) (or .cse10 (let ((.cse31 (or .cse35 .cse36))) (and (or .cse11 .cse26) (or (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse11) (or (and .cse30 .cse31 .cse33) .cse34)))))) (or .cse17 (and (or .cse18 .cse8) (or .cse10 (and .cse19 (or (and .cse37 .cse38 .cse39 .cse36 .cse40) .cse41) (or .cse41 (and .cse37 .cse38 .cse39 .cse40)) .cse22))))) .cse23) (or (and .cse4 .cse5 .cse6 .cse9 (or .cse10 .cse35) .cse7) .cse14))) (or (and (or (and .cse42 (or .cse10 (and .cse43 .cse44 .cse45)) (or .cse8 (let ((.cse46 (and .cse47 .cse44 .cse48 .cse49 .cse50))) (and (or .cse46 .cse3) (or .cse1 .cse46))))) .cse14) (or .cse23 (and (or .cse17 (and (or .cse10 (and .cse51 .cse52 .cse34)) (or .cse8 (and (or .cse1 .cse53) (or .cse3 .cse53))))) (or (and (or (and (or .cse1 .cse54) (or .cse54 .cse3)) .cse8) (or .cse10 .cse54)) .cse16)))) .cse24) (or (and (or (and (or .cse16 (and (or (and .cse55 .cse56 .cse44 (or .cse36 .cse57) .cse58 .cse59 .cse60) .cse10) (or .cse54 .cse8))) (or .cse17 (and (or (and .cse52 (or (and .cse61 .cse62 .cse63 .cse64) .cse41) .cse34) .cse10) (or .cse8 .cse53)))) .cse23) (or .cse14 (and .cse47 .cse42 .cse44 .cse48 .cse49 (or .cse10 .cse57) .cse50))) .cse25)))))))))) is different from true