./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:23:04,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:23:04,356 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:23:04,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:23:04,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:23:04,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:23:04,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:23:04,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:23:04,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:23:04,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:23:04,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:23:04,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:23:04,434 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:23:04,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:23:04,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:23:04,440 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:23:04,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:23:04,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:23:04,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:23:04,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:23:04,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:23:04,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:23:04,444 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:23:04,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:23:04,445 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:23:04,446 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:23:04,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:23:04,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:23:04,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:04,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:23:04,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:23:04,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:23:04,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:23:04,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:23:04,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:23:04,450 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:23:04,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:23:04,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:23:04,456 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:23:04,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2023-11-06 22:23:04,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:23:04,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:23:04,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:23:04,758 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:23:04,759 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:23:04,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-06 22:23:08,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:23:08,416 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:23:08,417 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-06 22:23:08,426 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/data/5d0482edb/145409cb6a7c4f62a461416d8f6f1396/FLAG92158d283 [2023-11-06 22:23:08,718 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/data/5d0482edb/145409cb6a7c4f62a461416d8f6f1396 [2023-11-06 22:23:08,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:23:08,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:23:08,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:08,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:23:08,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:23:08,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:08" (1/1) ... [2023-11-06 22:23:08,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4470557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:08, skipping insertion in model container [2023-11-06 22:23:08,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:08" (1/1) ... [2023-11-06 22:23:08,766 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:23:08,969 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-06 22:23:09,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:09,019 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:23:09,037 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-06 22:23:09,061 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:09,091 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:23:09,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09 WrapperNode [2023-11-06 22:23:09,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:09,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:09,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:23:09,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:23:09,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,143 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2023-11-06 22:23:09,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:09,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:23:09,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:23:09,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:23:09,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:23:09,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:23:09,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:23:09,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:23:09,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (1/1) ... [2023-11-06 22:23:09,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:09,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:09,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:23:09,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:23:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:23:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:23:09,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:23:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:23:09,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:23:09,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:23:09,349 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:23:09,352 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:23:09,601 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:23:09,609 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:23:09,609 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:23:09,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:09 BoogieIcfgContainer [2023-11-06 22:23:09,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:23:09,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:23:09,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:23:09,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:23:09,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:08" (1/3) ... [2023-11-06 22:23:09,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e371c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:09, skipping insertion in model container [2023-11-06 22:23:09,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:09" (2/3) ... [2023-11-06 22:23:09,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e371c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:09, skipping insertion in model container [2023-11-06 22:23:09,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:09" (3/3) ... [2023-11-06 22:23:09,628 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2023-11-06 22:23:09,643 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:23:09,643 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:23:09,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:23:09,727 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36b695e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:23:09,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:23:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:23:09,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:09,750 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:09,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:09,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1486853155, now seen corresponding path program 1 times [2023-11-06 22:23:09,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:09,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43551684] [2023-11-06 22:23:09,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:23:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:23:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:23:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:23:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:23:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:23:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:23:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:23:10,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:10,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43551684] [2023-11-06 22:23:10,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43551684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:10,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:10,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:23:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071262505] [2023-11-06 22:23:10,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:23:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:10,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:23:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:23:10,128 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:23:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:10,165 INFO L93 Difference]: Finished difference Result 75 states and 121 transitions. [2023-11-06 22:23:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:23:10,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2023-11-06 22:23:10,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:10,177 INFO L225 Difference]: With dead ends: 75 [2023-11-06 22:23:10,177 INFO L226 Difference]: Without dead ends: 37 [2023-11-06 22:23:10,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:23:10,190 INFO L413 NwaCegarLoop]: 52 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, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:10,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:23:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-06 22:23:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-06 22:23:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2023-11-06 22:23:10,255 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 63 [2023-11-06 22:23:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:10,257 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2023-11-06 22:23:10,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:23:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2023-11-06 22:23:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:23:10,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:10,266 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:10,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:23:10,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:10,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:10,269 INFO L85 PathProgramCache]: Analyzing trace with hash 237651611, now seen corresponding path program 1 times [2023-11-06 22:23:10,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:10,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626600949] [2023-11-06 22:23:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:23:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:23:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:23:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:23:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:23:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:23:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:23:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:23:10,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626600949] [2023-11-06 22:23:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626600949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:10,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:10,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:10,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242235502] [2023-11-06 22:23:10,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:10,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:23:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:10,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:23:10,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:10,657 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:10,682 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2023-11-06 22:23:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2023-11-06 22:23:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:10,685 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:23:10,685 INFO L226 Difference]: Without dead ends: 38 [2023-11-06 22:23:10,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:10,705 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:10,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:23:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-06 22:23:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-06 22:23:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2023-11-06 22:23:10,716 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 63 [2023-11-06 22:23:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:10,721 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2023-11-06 22:23:10,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2023-11-06 22:23:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:23:10,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:10,727 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:10,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:23:10,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:10,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash -89088264, now seen corresponding path program 1 times [2023-11-06 22:23:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:10,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690611726] [2023-11-06 22:23:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:10,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:23:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:23:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:23:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:23:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:23:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:23:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:23:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:23:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:11,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690611726] [2023-11-06 22:23:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690611726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:11,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:11,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864848787] [2023-11-06 22:23:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:11,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:11,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:11,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:11,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:11,109 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:11,282 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2023-11-06 22:23:11,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:23:11,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2023-11-06 22:23:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:11,287 INFO L225 Difference]: With dead ends: 109 [2023-11-06 22:23:11,287 INFO L226 Difference]: Without dead ends: 74 [2023-11-06 22:23:11,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:23:11,290 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 33 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:11,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 278 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:23:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-06 22:23:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 46. [2023-11-06 22:23:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2023-11-06 22:23:11,307 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 64 [2023-11-06 22:23:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:11,308 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2023-11-06 22:23:11,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2023-11-06 22:23:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:23:11,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:11,311 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:11,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:23:11,312 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:11,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash 577207105, now seen corresponding path program 1 times [2023-11-06 22:23:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987376987] [2023-11-06 22:23:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:23:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:23:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:23:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:23:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:23:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:23:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:23:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:23:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:23:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:23:11,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987376987] [2023-11-06 22:23:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987376987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342075412] [2023-11-06 22:23:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:11,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:23:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:23:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:11,511 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:11,563 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2023-11-06 22:23:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:11,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2023-11-06 22:23:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:11,566 INFO L225 Difference]: With dead ends: 106 [2023-11-06 22:23:11,566 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 22:23:11,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:11,569 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:11,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:23:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 22:23:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2023-11-06 22:23:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2023-11-06 22:23:11,581 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 64 [2023-11-06 22:23:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:11,582 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2023-11-06 22:23:11,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2023-11-06 22:23:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 22:23:11,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:11,584 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:11,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:23:11,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:11,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 96286512, now seen corresponding path program 1 times [2023-11-06 22:23:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482701533] [2023-11-06 22:23:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:11,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:23:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:11,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:23:11,676 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:23:11,677 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:23:11,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:23:11,685 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:23:11,689 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:23:11,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:23:11 BoogieIcfgContainer [2023-11-06 22:23:11,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:23:11,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:23:11,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:23:11,761 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:23:11,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:09" (3/4) ... [2023-11-06 22:23:11,765 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:23:11,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:23:11,769 INFO L158 Benchmark]: Toolchain (without parser) took 3044.53ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 121.1MB in the beginning and 113.8MB in the end (delta: 7.3MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2023-11-06 22:23:11,769 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:23:11,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.96ms. Allocated memory is still 159.4MB. Free memory was 121.1MB in the beginning and 110.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:23:11,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.01ms. Allocated memory is still 159.4MB. Free memory was 110.2MB in the beginning and 108.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:11,776 INFO L158 Benchmark]: Boogie Preprocessor took 33.68ms. Allocated memory is still 159.4MB. Free memory was 108.5MB in the beginning and 107.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:11,776 INFO L158 Benchmark]: RCFGBuilder took 432.77ms. Allocated memory is still 159.4MB. Free memory was 107.0MB in the beginning and 93.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:23:11,777 INFO L158 Benchmark]: TraceAbstraction took 2144.17ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 93.4MB in the beginning and 114.8MB in the end (delta: -21.4MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2023-11-06 22:23:11,777 INFO L158 Benchmark]: Witness Printer took 6.59ms. Allocated memory is still 216.0MB. Free memory was 114.8MB in the beginning and 113.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:23:11,784 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.96ms. Allocated memory is still 159.4MB. Free memory was 121.1MB in the beginning and 110.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.01ms. Allocated memory is still 159.4MB. Free memory was 110.2MB in the beginning and 108.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.68ms. Allocated memory is still 159.4MB. Free memory was 108.5MB in the beginning and 107.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.77ms. Allocated memory is still 159.4MB. Free memory was 107.0MB in the beginning and 93.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2144.17ms. Allocated memory was 159.4MB in the beginning and 216.0MB in the end (delta: 56.6MB). Free memory was 93.4MB in the beginning and 114.8MB in the end (delta: -21.4MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Witness Printer took 6.59ms. Allocated memory is still 216.0MB. Free memory was 114.8MB in the beginning and 113.8MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 25.25; [L23] signed short int var_1_2 = -25; [L24] signed short int var_1_3 = -500; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 0; [L27] double var_1_6 = 127.25; VAL [isInitial=0, var_1_1=101/4, var_1_2=-25, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L64] isInitial = 1 [L65] FCALL initially() [L66] COND TRUE 1 [L67] FCALL updateLastVariables() [L68] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_short() [L43] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L43] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L44] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L44] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-500, var_1_4=1, var_1_5=0, var_1_6=509/4] [L45] var_1_3 = __VERIFIER_nondet_short() [L46] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L46] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L47] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L47] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L50] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L50] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=0, var_1_6=509/4] [L51] var_1_5 = __VERIFIER_nondet_uchar() [L52] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L52] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L53] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L53] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=509/4] [L54] var_1_6 = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] [L55] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] [L68] RET updateVariables() [L69] CALL step() [L31] EXPR var_1_2 & var_1_3 VAL [isInitial=1, var_1_1=101/4, var_1_2 & var_1_3=0, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] [L31] COND TRUE (var_1_2 & var_1_3) >= -64 [L32] COND TRUE var_1_2 > var_1_3 VAL [isInitial=1, var_1_1=101/4, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] [L33] COND TRUE (var_1_2 > var_1_3) && (var_1_4 || var_1_5) [L34] var_1_1 = var_1_6 VAL [isInitial=1, var_1_1=518, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] [L69] RET step() [L70] CALL, EXPR property() [L60] EXPR var_1_2 & var_1_3 VAL [isInitial=1, var_1_1=518, var_1_2 & var_1_3=0, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] [L60-L61] return ((var_1_2 & var_1_3) >= -64) ? ((var_1_2 > var_1_3) ? (((var_1_2 > var_1_3) && (var_1_4 || var_1_5)) ? (var_1_1 == ((double) var_1_6)) : (var_1_1 == ((double) var_1_6))) : 1) : 1 ; [L70] RET, EXPR property() [L70] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=518, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=518, var_1_2=0, var_1_3=-1, var_1_4=1, var_1_5=1, var_1_6=518] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 510 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 241 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=4, InterpolantAutomatonStates: 16, 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, 39 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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 [2023-11-06 22:23:11,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:23:14,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:23:15,078 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:23:15,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:23:15,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:23:15,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:23:15,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:23:15,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:23:15,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:23:15,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:23:15,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:23:15,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:23:15,128 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:23:15,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:23:15,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:23:15,130 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:23:15,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:23:15,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:23:15,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:23:15,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:23:15,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:23:15,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:23:15,134 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:23:15,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:23:15,135 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:23:15,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:23:15,136 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:23:15,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:23:15,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:23:15,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:23:15,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:15,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:23:15,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:23:15,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:23:15,140 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:23:15,140 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:23:15,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:23:15,141 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:23:15,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:23:15,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:23:15,143 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:23:15,144 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:23:15,144 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2023-11-06 22:23:15,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:23:15,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:23:15,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:23:15,609 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:23:15,609 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:23:15,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-06 22:23:19,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:23:19,369 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:23:19,369 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-06 22:23:19,378 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/data/5c42263a9/71ac5e04e5b1473b94d13009673a1d47/FLAGcfad5c551 [2023-11-06 22:23:19,398 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/data/5c42263a9/71ac5e04e5b1473b94d13009673a1d47 [2023-11-06 22:23:19,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:23:19,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:23:19,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:19,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:23:19,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:23:19,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28662ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19, skipping insertion in model container [2023-11-06 22:23:19,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,446 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:23:19,666 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-06 22:23:19,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:19,726 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:23:19,750 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-06 22:23:19,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:19,823 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:23:19,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19 WrapperNode [2023-11-06 22:23:19,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:19,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:19,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:23:19,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:23:19,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,912 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2023-11-06 22:23:19,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:19,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:23:19,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:23:19,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:23:19,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:23:19,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:23:19,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:23:19,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:23:19,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (1/1) ... [2023-11-06 22:23:19,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:19,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:20,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:23:20,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:23:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:23:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:23:20,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:23:20,089 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:23:20,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:23:20,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:23:20,199 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:23:20,201 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:23:20,507 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:23:20,544 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:23:20,546 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:23:20,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:20 BoogieIcfgContainer [2023-11-06 22:23:20,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:23:20,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:23:20,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:23:20,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:23:20,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:19" (1/3) ... [2023-11-06 22:23:20,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d480303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:20, skipping insertion in model container [2023-11-06 22:23:20,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:19" (2/3) ... [2023-11-06 22:23:20,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d480303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:20, skipping insertion in model container [2023-11-06 22:23:20,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:20" (3/3) ... [2023-11-06 22:23:20,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2023-11-06 22:23:20,585 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:23:20,586 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:23:20,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:23:20,652 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28635522, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:23:20,652 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:23:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:23:20,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:20,668 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:20,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:20,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1788319009, now seen corresponding path program 1 times [2023-11-06 22:23:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29745069] [2023-11-06 22:23:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:20,694 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 [2023-11-06 22:23:20,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:20,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:23:20,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:20,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:23:20,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-11-06 22:23:20,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:20,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:20,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29745069] [2023-11-06 22:23:20,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29745069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:20,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:20,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:23:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059393267] [2023-11-06 22:23:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:20,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:23:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:21,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:23:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:23:21,045 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:23:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:21,090 INFO L93 Difference]: Finished difference Result 65 states and 103 transitions. [2023-11-06 22:23:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:23:21,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2023-11-06 22:23:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:21,103 INFO L225 Difference]: With dead ends: 65 [2023-11-06 22:23:21,103 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:23:21,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:23:21,116 INFO L413 NwaCegarLoop]: 43 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, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:21,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:23:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:23:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-06 22:23:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-11-06 22:23:21,174 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 60 [2023-11-06 22:23:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:21,175 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-11-06 22:23:21,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-06 22:23:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-11-06 22:23:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:23:21,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:21,182 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:21,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:21,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:21,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:21,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:21,397 INFO L85 PathProgramCache]: Analyzing trace with hash 848607457, now seen corresponding path program 1 times [2023-11-06 22:23:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274924075] [2023-11-06 22:23:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:21,398 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 [2023-11-06 22:23:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:21,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:23:21,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:21,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:23:21,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:23:21,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:21,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:21,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274924075] [2023-11-06 22:23:21,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274924075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:21,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:21,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:23:21,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314606986] [2023-11-06 22:23:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:21,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:21,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:21,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:21,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:21,858 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:23,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:23:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:24,032 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2023-11-06 22:23:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:24,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-11-06 22:23:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:24,036 INFO L225 Difference]: With dead ends: 61 [2023-11-06 22:23:24,037 INFO L226 Difference]: Without dead ends: 59 [2023-11-06 22:23:24,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:24,039 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:24,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 235 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2023-11-06 22:23:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-06 22:23:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2023-11-06 22:23:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-06 22:23:24,054 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 60 [2023-11-06 22:23:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:24,055 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-06 22:23:24,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-06 22:23:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:23:24,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:24,058 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:24,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:24,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:24,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:24,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash 131539201, now seen corresponding path program 1 times [2023-11-06 22:23:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:24,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577207007] [2023-11-06 22:23:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:24,275 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 [2023-11-06 22:23:24,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:24,277 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:23:24,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:24,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:23:24,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-06 22:23:24,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:24,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577207007] [2023-11-06 22:23:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577207007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:24,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646288882] [2023-11-06 22:23:24,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:24,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:24,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:24,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:24,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:24,587 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:26,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:23:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:26,404 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2023-11-06 22:23:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:23:26,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2023-11-06 22:23:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:26,407 INFO L225 Difference]: With dead ends: 66 [2023-11-06 22:23:26,407 INFO L226 Difference]: Without dead ends: 64 [2023-11-06 22:23:26,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:23:26,409 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:26,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 232 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:23:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-06 22:23:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2023-11-06 22:23:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 22:23:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-06 22:23:26,421 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 61 [2023-11-06 22:23:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:26,422 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-06 22:23:26,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-06 22:23:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-06 22:23:26,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:23:26,425 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:26,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:26,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:26,647 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:23:26,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -455582954, now seen corresponding path program 1 times [2023-11-06 22:23:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689696391] [2023-11-06 22:23:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:26,649 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 [2023-11-06 22:23:26,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:26,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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) [2023-11-06 22:23:26,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:26,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:23:26,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-06 22:23:29,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:29,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689696391] [2023-11-06 22:23:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689696391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:23:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848586106] [2023-11-06 22:23:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:29,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:23:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:29,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:23:29,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:23:29,475 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:23:39,654 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2023-11-06 22:23:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:23:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2023-11-06 22:23:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:23:39,659 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:23:39,659 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:23:39,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:23:39,661 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 66 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:23:39,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 220 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-11-06 22:23:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:23:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:23:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:23:39,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2023-11-06 22:23:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:23:39,664 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:23:39,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-06 22:23:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:23:39,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:23:39,668 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:23:39,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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)] Ended with exit code 0 [2023-11-06 22:23:39,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/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 [2023-11-06 22:23:39,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:23:48,468 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 39) no Hoare annotation was computed. [2023-11-06 22:23:48,469 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,470 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,470 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:23:48,470 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:23:48,471 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,471 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-11-06 22:23:48,471 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 63 74) the Hoare annotation is: false [2023-11-06 22:23:48,471 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 38) no Hoare annotation was computed. [2023-11-06 22:23:48,471 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:23:48,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:23:48,472 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 29) no Hoare annotation was computed. [2023-11-06 22:23:48,472 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 58) no Hoare annotation was computed. [2023-11-06 22:23:48,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:23:48,472 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-06 22:23:48,473 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,473 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,473 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 59 62) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_property_#res#1| (_ bv1 32))) (.cse0 (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))))) (or (and .cse0 (let ((.cse3 ((_ sign_extend 16) ~var_1_3~0)) (.cse2 ((_ sign_extend 16) ~var_1_2~0))) (or (and .cse1 (not (bvsgt .cse2 .cse3))) (and .cse1 (not (bvsge (bvand .cse3 .cse2) (_ bv4294967232 32))))))) (and .cse1 (= ~var_1_1~0 ~var_1_6~0) .cse0))) [2023-11-06 22:23:48,474 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-11-06 22:23:48,474 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:23:48,474 INFO L895 garLoopResultBuilder]: At program point L66-2(lines 66 72) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,474 INFO L899 garLoopResultBuilder]: For program point L66-3(lines 66 72) no Hoare annotation was computed. [2023-11-06 22:23:48,474 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-06 22:23:48,475 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,475 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,475 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:23:48,475 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 40) no Hoare annotation was computed. [2023-11-06 22:23:48,476 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2023-11-06 22:23:48,476 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 41 56) no Hoare annotation was computed. [2023-11-06 22:23:48,476 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-06 22:23:48,476 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,476 INFO L895 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,477 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:23:48,477 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:23:48,477 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:23:48,477 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:23:48,481 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:23:48,485 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:23:48,506 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,508 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,519 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,520 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,521 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,521 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,522 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,522 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,523 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,524 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,529 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,532 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,539 ERROR L462 ceAbstractionStarter]: Failed to backtranslate (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,539 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,540 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,540 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,541 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,541 ERROR L462 ceAbstractionStarter]: Failed to backtranslate (or (exists ((currentRoundingMode RoundingMode)) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) (exists ((currentRoundingMode RoundingMode)) (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))))))) [2023-11-06 22:23:48,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:23:48 BoogieIcfgContainer [2023-11-06 22:23:48,542 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:23:48,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:23:48,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:23:48,543 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:23:48,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:20" (3/4) ... [2023-11-06 22:23:48,549 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:23:48,554 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:23:48,562 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:23:48,563 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 22:23:48,563 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:23:48,563 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:23:48,605 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1) && !((var_1_2 > var_1_3))) || ((\result == 1) && !(((var_1_3 & var_1_2) >= -64)))) || ((\result == 1) && (var_1_1 == var_1_6))) [2023-11-06 22:23:48,645 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1) && !((var_1_2 > var_1_3))) || ((\result == 1) && !(((var_1_3 & var_1_2) >= -64)))) || ((\result == 1) && (var_1_1 == var_1_6))) [2023-11-06 22:23:48,658 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:23:48,659 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:23:48,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:23:48,660 INFO L158 Benchmark]: Toolchain (without parser) took 29256.37ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 72.5MB in the end (delta: 21.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:48,660 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 62.9MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:23:48,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.72ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 81.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:23:48,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.16ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:23:48,662 INFO L158 Benchmark]: Boogie Preprocessor took 55.13ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:48,662 INFO L158 Benchmark]: RCFGBuilder took 579.53ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 95.7MB in the end (delta: -17.3MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-06 22:23:48,663 INFO L158 Benchmark]: TraceAbstraction took 27986.98ms. Allocated memory is still 117.4MB. Free memory was 95.0MB in the beginning and 76.7MB in the end (delta: 18.3MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2023-11-06 22:23:48,663 INFO L158 Benchmark]: Witness Printer took 116.65ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 72.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:48,667 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 62.9MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.72ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 81.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.16ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.13ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 579.53ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 95.7MB in the end (delta: -17.3MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27986.98ms. Allocated memory is still 117.4MB. Free memory was 95.0MB in the beginning and 76.7MB in the end (delta: 18.3MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * Witness Printer took 116.65ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 72.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 730 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 499 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 231 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 33, 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, 53 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 40 PreInvPairs, 67 NumberOfFragments, 455 HoareAnnotationTreeSize, 40 FomulaSimplifications, 21 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 737 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 239 ConstructedInterpolants, 5 QuantifiedInterpolants, 492 SizeOfPredicates, 23 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 59]: Loop Invariant [2023-11-06 22:23:48,691 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,692 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,693 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,693 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,694 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,694 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,695 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,695 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated Derived loop invariant: ((((\result == 1) && !((var_1_2 > var_1_3))) || ((\result == 1) && !(((var_1_3 & var_1_2) >= -64)))) || ((\result == 1) && (var_1_1 == var_1_6))) - InvariantResult [Line: 66]: Loop Invariant [2023-11-06 22:23:48,695 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,696 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,696 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,696 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated Derived loop invariant: NULL - InvariantResult [Line: 19]: Loop Invariant [2023-11-06 22:23:48,697 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,697 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated [2023-11-06 22:23:48,698 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 9.2233720368547656E18)))) && ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1/100000000000000000000))))) could not be translated [2023-11-06 22:23:48,698 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists currentRoundingMode : FloatRoundingMode :: ~fp.leq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 9.2233720368547656E18))) && ~fp.geq~64(~var_1_6~0, ~to_fp~64(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1/100000000000000000000)))) could not be translated Derived loop invariant: NULL RESULT: Ultimate proved your program to be correct! [2023-11-06 22:23:48,922 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-06 22:23:48,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05e81d93-d038-4101-ba73-095fa9cdfb5f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE