./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 cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:21:32,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:21:32,161 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:21:32,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:21:32,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:21:32,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:21:32,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:21:32,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:21:32,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:21:32,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:21:32,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:21:32,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:21:32,200 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:21:32,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:21:32,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:21:32,202 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:21:32,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:21:32,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:21:32,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:21:32,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:21:32,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:21:32,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:21:32,206 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:21:32,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:21:32,207 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:21:32,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:21:32,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:21:32,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:21:32,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:32,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:21:32,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:21:32,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:21:32,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:21:32,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:21:32,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:21:32,212 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:21:32,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:21:32,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:21:32,214 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:21:32,214 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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2023-11-12 02:21:32,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:21:32,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:21:32,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:21:32,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:21:32,540 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:21:32,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-12 02:21:35,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:21:35,946 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:21:35,946 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-12 02:21:35,959 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/data/7feed4789/721859b536fa4476a6a1b57f9df4df51/FLAG57a775995 [2023-11-12 02:21:35,982 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/data/7feed4789/721859b536fa4476a6a1b57f9df4df51 [2023-11-12 02:21:35,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:21:35,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:21:35,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:35,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:21:36,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:21:36,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:35" (1/1) ... [2023-11-12 02:21:36,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7172b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36, skipping insertion in model container [2023-11-12 02:21:36,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:35" (1/1) ... [2023-11-12 02:21:36,044 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:21:36,250 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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-12 02:21:36,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:36,303 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:21:36,314 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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-12 02:21:36,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:36,344 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:21:36,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36 WrapperNode [2023-11-12 02:21:36,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:36,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:36,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:21:36,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:21:36,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,390 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2023-11-12 02:21:36,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:36,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:21:36,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:21:36,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:21:36,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:21:36,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:21:36,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:21:36,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:21:36,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (1/1) ... [2023-11-12 02:21:36,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:36,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:21:36,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:21:36,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:21:36,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:21:36,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:21:36,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:21:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:21:36,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:21:36,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:21:36,595 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:21:36,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:21:36,875 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:21:36,882 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:21:36,882 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:21:36,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:36 BoogieIcfgContainer [2023-11-12 02:21:36,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:21:36,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:21:36,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:21:36,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:21:36,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:21:35" (1/3) ... [2023-11-12 02:21:36,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55348691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:36, skipping insertion in model container [2023-11-12 02:21:36,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:36" (2/3) ... [2023-11-12 02:21:36,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55348691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:36, skipping insertion in model container [2023-11-12 02:21:36,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:36" (3/3) ... [2023-11-12 02:21:36,896 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2023-11-12 02:21:36,922 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:21:36,922 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:21:36,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:21:36,985 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f630676, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:21:36,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:21:36,992 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-12 02:21:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-12 02:21:37,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:37,005 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-12 02:21:37,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:37,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1486853155, now seen corresponding path program 1 times [2023-11-12 02:21:37,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:37,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624020270] [2023-11-12 02:21:37,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:21:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:21:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:21:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:21:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:21:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:21:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:21:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:21:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,313 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-12 02:21:37,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:37,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624020270] [2023-11-12 02:21:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624020270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:37,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:37,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:21:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193884147] [2023-11-12 02:21:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:37,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:21:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:21:37,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:21:37,365 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-12 02:21:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:37,403 INFO L93 Difference]: Finished difference Result 75 states and 121 transitions. [2023-11-12 02:21:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:21:37,406 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-12 02:21:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:37,414 INFO L225 Difference]: With dead ends: 75 [2023-11-12 02:21:37,414 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 02:21:37,417 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-12 02:21:37,421 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-12 02:21:37,423 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-12 02:21:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 02:21:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-12 02:21:37,484 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-12 02:21:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2023-11-12 02:21:37,488 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 63 [2023-11-12 02:21:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:37,489 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2023-11-12 02:21:37,489 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-12 02:21:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2023-11-12 02:21:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-12 02:21:37,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:37,494 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-12 02:21:37,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:21:37,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:37,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 237651611, now seen corresponding path program 1 times [2023-11-12 02:21:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:37,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793148667] [2023-11-12 02:21:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:21:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:21:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:21:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:21:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:21:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:21:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:21:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:21:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:37,789 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-12 02:21:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793148667] [2023-11-12 02:21:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793148667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:37,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:37,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:21:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163235434] [2023-11-12 02:21:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:37,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:21:37,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:37,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:21:37,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:21:37,794 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-12 02:21:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:37,824 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2023-11-12 02:21:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:21:37,825 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-12 02:21:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:37,827 INFO L225 Difference]: With dead ends: 72 [2023-11-12 02:21:37,827 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 02:21:37,828 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-12 02:21:37,830 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-12 02:21:37,831 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-12 02:21:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 02:21:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-12 02:21:37,840 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-12 02:21:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2023-11-12 02:21:37,842 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 63 [2023-11-12 02:21:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:37,844 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2023-11-12 02:21:37,844 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-12 02:21:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2023-11-12 02:21:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-12 02:21:37,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:37,847 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-12 02:21:37,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:21:37,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:37,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash -89088264, now seen corresponding path program 1 times [2023-11-12 02:21:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302519284] [2023-11-12 02:21:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:37,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:21:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:21:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:21:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:21:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:21:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:21:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:21:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:21:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,372 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-12 02:21:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302519284] [2023-11-12 02:21:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302519284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:38,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:21:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448237163] [2023-11-12 02:21:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:38,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:21:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:21:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:21:38,383 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-12 02:21:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:38,605 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2023-11-12 02:21:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:21:38,606 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-12 02:21:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:38,609 INFO L225 Difference]: With dead ends: 109 [2023-11-12 02:21:38,609 INFO L226 Difference]: Without dead ends: 74 [2023-11-12 02:21:38,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:21:38,611 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-12 02:21:38,612 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-12 02:21:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-12 02:21:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 46. [2023-11-12 02:21:38,623 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-12 02:21:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2023-11-12 02:21:38,624 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 64 [2023-11-12 02:21:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:38,625 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2023-11-12 02:21:38,626 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-12 02:21:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2023-11-12 02:21:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-12 02:21:38,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:38,628 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-12 02:21:38,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:21:38,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:38,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 577207105, now seen corresponding path program 1 times [2023-11-12 02:21:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:38,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522640772] [2023-11-12 02:21:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:21:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:21:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:21:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:21:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-12 02:21:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:21:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:21:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-12 02:21:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:21:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:38,785 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-12 02:21:38,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:38,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522640772] [2023-11-12 02:21:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522640772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:38,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:21:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873069354] [2023-11-12 02:21:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:38,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:21:38,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:38,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:21:38,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:21:38,790 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-12 02:21:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:38,862 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2023-11-12 02:21:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:21:38,863 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-12 02:21:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:38,867 INFO L225 Difference]: With dead ends: 106 [2023-11-12 02:21:38,867 INFO L226 Difference]: Without dead ends: 63 [2023-11-12 02:21:38,871 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-12 02:21:38,881 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-12 02:21:38,882 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-12 02:21:38,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-12 02:21:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2023-11-12 02:21:38,893 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-12 02:21:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2023-11-12 02:21:38,895 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 64 [2023-11-12 02:21:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:38,895 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2023-11-12 02:21:38,896 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-12 02:21:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2023-11-12 02:21:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-12 02:21:38,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:38,899 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-12 02:21:38,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:21:38,900 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:38,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 96286512, now seen corresponding path program 1 times [2023-11-12 02:21:38,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44023456] [2023-11-12 02:21:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:21:38,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:21:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:21:39,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:21:39,015 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:21:39,016 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:21:39,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:21:39,023 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-12 02:21:39,027 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:21:39,092 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-12 02:21:39,098 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-12 02:21:39,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:21:39 BoogieIcfgContainer [2023-11-12 02:21:39,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:21:39,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:21:39,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:21:39,121 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:21:39,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:36" (3/4) ... [2023-11-12 02:21:39,125 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:21:39,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:21:39,127 INFO L158 Benchmark]: Toolchain (without parser) took 3133.49ms. Allocated memory is still 157.3MB. Free memory was 109.9MB in the beginning and 98.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,128 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 123.7MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:21:39,129 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.88ms. Allocated memory is still 157.3MB. Free memory was 109.2MB in the beginning and 98.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.61ms. Allocated memory is still 157.3MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,131 INFO L158 Benchmark]: Boogie Preprocessor took 30.19ms. Allocated memory is still 157.3MB. Free memory was 96.0MB in the beginning and 95.2MB in the end (delta: 808.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,133 INFO L158 Benchmark]: RCFGBuilder took 463.45ms. Allocated memory is still 157.3MB. Free memory was 95.2MB in the beginning and 82.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:21:39,133 INFO L158 Benchmark]: TraceAbstraction took 2231.75ms. Allocated memory is still 157.3MB. Free memory was 81.3MB in the beginning and 98.4MB in the end (delta: -17.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:21:39,133 INFO L158 Benchmark]: Witness Printer took 6.32ms. Allocated memory is still 157.3MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:21:39,136 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.56ms. Allocated memory is still 123.7MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.88ms. Allocated memory is still 157.3MB. Free memory was 109.2MB in the beginning and 98.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.61ms. Allocated memory is still 157.3MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.19ms. Allocated memory is still 157.3MB. Free memory was 96.0MB in the beginning and 95.2MB in the end (delta: 808.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 463.45ms. Allocated memory is still 157.3MB. Free memory was 95.2MB in the beginning and 82.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2231.75ms. Allocated memory is still 157.3MB. Free memory was 81.3MB in the beginning and 98.4MB in the end (delta: -17.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.32ms. Allocated memory is still 157.3MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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=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=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.1s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, 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.2s 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.1s SatisfiabilityAnalysisTime, 1.0s 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-12 02:21:39,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:21:41,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:21:42,027 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-12 02:21:42,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:21:42,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:21:42,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:21:42,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:21:42,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:21:42,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:21:42,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:21:42,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:21:42,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:21:42,095 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:21:42,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:21:42,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:21:42,098 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:21:42,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:21:42,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:21:42,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:21:42,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:21:42,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:21:42,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:21:42,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:21:42,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:21:42,102 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:21:42,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:21:42,103 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:21:42,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:21:42,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:21:42,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:21:42,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:42,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:21:42,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:21:42,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:21:42,108 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:21:42,108 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:21:42,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:21:42,108 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:21:42,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:21:42,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:21:42,110 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:21:42,110 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:21:42,111 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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bda6c68e75a5e1d4b22d268fd7dd6b5dc3f24d40b1359eafc553077fa5557247 [2023-11-12 02:21:42,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:21:42,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:21:42,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:21:42,507 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:21:42,508 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:21:42,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-12 02:21:45,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:21:45,900 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:21:45,901 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i [2023-11-12 02:21:45,909 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/data/ded800cc0/daebe739aad347ab8a7c91cf83a908ad/FLAG663ee46a0 [2023-11-12 02:21:45,924 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/data/ded800cc0/daebe739aad347ab8a7c91cf83a908ad [2023-11-12 02:21:45,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:21:45,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:21:45,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:45,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:21:45,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:21:45,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:45" (1/1) ... [2023-11-12 02:21:45,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a67fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:45, skipping insertion in model container [2023-11-12 02:21:45,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:45" (1/1) ... [2023-11-12 02:21:45,966 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:21:46,119 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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-12 02:21:46,146 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:46,161 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:21:46,174 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_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-47.i[915,928] [2023-11-12 02:21:46,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:46,206 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:21:46,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46 WrapperNode [2023-11-12 02:21:46,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:46,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:46,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:21:46,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:21:46,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,270 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2023-11-12 02:21:46,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:46,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:21:46,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:21:46,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:21:46,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:21:46,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:21:46,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:21:46,307 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:21:46,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (1/1) ... [2023-11-12 02:21:46,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:46,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:21:46,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:21:46,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:21:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:21:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:21:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:21:46,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:21:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:21:46,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:21:46,467 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:21:46,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:21:46,730 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:21:46,737 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:21:46,737 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:21:46,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:46 BoogieIcfgContainer [2023-11-12 02:21:46,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:21:46,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:21:46,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:21:46,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:21:46,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:21:45" (1/3) ... [2023-11-12 02:21:46,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef1509e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:46, skipping insertion in model container [2023-11-12 02:21:46,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:46" (2/3) ... [2023-11-12 02:21:46,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef1509e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:46, skipping insertion in model container [2023-11-12 02:21:46,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:46" (3/3) ... [2023-11-12 02:21:46,749 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-47.i [2023-11-12 02:21:46,769 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:21:46,770 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:21:46,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:21:46,844 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@16eda9eb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:21:46,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:21:46,849 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-12 02:21:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-12 02:21:46,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:46,862 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-12 02:21:46,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:46,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1788319009, now seen corresponding path program 1 times [2023-11-12 02:21:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:21:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711443199] [2023-11-12 02:21:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:46,891 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-12 02:21:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:21:46,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:46,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:47,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:21:47,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:21:47,136 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-12 02:21:47,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:21:47,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:21:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711443199] [2023-11-12 02:21:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711443199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:47,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:47,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:21:47,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127683925] [2023-11-12 02:21:47,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:47,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:21:47,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:21:47,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:21:47,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:21:47,199 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-12 02:21:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:47,241 INFO L93 Difference]: Finished difference Result 65 states and 103 transitions. [2023-11-12 02:21:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:21:47,243 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-12 02:21:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:47,251 INFO L225 Difference]: With dead ends: 65 [2023-11-12 02:21:47,251 INFO L226 Difference]: Without dead ends: 32 [2023-11-12 02:21:47,256 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-12 02:21:47,261 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-12 02:21:47,262 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-12 02:21:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-12 02:21:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-12 02:21:47,310 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-12 02:21:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2023-11-12 02:21:47,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 60 [2023-11-12 02:21:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:47,316 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2023-11-12 02:21:47,317 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-12 02:21:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2023-11-12 02:21:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-12 02:21:47,322 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:47,323 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-12 02:21:47,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-12 02:21:47,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:47,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:47,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 848607457, now seen corresponding path program 1 times [2023-11-12 02:21:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:21:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000857077] [2023-11-12 02:21:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:47,538 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-12 02:21:47,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:21:47,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:47,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:47,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:21:47,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:21:47,945 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-12 02:21:47,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:21:47,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:21:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000857077] [2023-11-12 02:21:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000857077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:47,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:47,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:21:47,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868104801] [2023-11-12 02:21:47,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:47,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:47,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:21:47,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:47,956 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-12 02:21:50,035 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-12 02:21:52,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:21:54,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:21:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:54,577 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2023-11-12 02:21:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:21:54,578 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-12 02:21:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:54,580 INFO L225 Difference]: With dead ends: 61 [2023-11-12 02:21:54,580 INFO L226 Difference]: Without dead ends: 59 [2023-11-12 02:21:54,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:21:54,582 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:54,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 235 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2023-11-12 02:21:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-12 02:21:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2023-11-12 02:21:54,594 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-12 02:21:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-12 02:21:54,595 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 60 [2023-11-12 02:21:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:54,596 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-12 02:21:54,597 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-12 02:21:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-12 02:21:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-12 02:21:54,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:54,599 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-12 02:21:54,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:54,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:54,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:54,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash 131539201, now seen corresponding path program 1 times [2023-11-12 02:21:54,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:21:54,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142140684] [2023-11-12 02:21:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:54,824 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-12 02:21:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:21:54,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:54,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:54,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-12 02:21:54,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:21:55,020 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-12 02:21:55,023 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:21:55,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:21:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142140684] [2023-11-12 02:21:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142140684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:55,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:55,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:21:55,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636239183] [2023-11-12 02:21:55,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:55,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:21:55,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:21:55,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:21:55,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:21:55,037 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-12 02:21:57,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-12 02:21:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:21:58,519 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2023-11-12 02:21:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:21:58,519 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-12 02:21:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:21:58,521 INFO L225 Difference]: With dead ends: 66 [2023-11-12 02:21:58,522 INFO L226 Difference]: Without dead ends: 64 [2023-11-12 02:21:58,522 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-12 02:21:58,523 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:21:58,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 277 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2023-11-12 02:21:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-12 02:21:58,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 35. [2023-11-12 02:21:58,533 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-12 02:21:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-12 02:21:58,535 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 61 [2023-11-12 02:21:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:21:58,536 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-12 02:21:58,536 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-12 02:21:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-12 02:21:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-12 02:21:58,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:21:58,538 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-12 02:21:58,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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)] Ended with exit code 0 [2023-11-12 02:21:58,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:58,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:21:58,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:58,752 INFO L85 PathProgramCache]: Analyzing trace with hash -455582954, now seen corresponding path program 1 times [2023-11-12 02:21:58,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:21:58,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747692950] [2023-11-12 02:21:58,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:58,753 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-12 02:21:58,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:21:58,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:58,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:21:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:58,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 02:21:58,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:22:01,499 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-12 02:22:01,499 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:22:01,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:22:01,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747692950] [2023-11-12 02:22:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747692950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:22:01,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:22:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:22:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974614555] [2023-11-12 02:22:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:22:01,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:22:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:22:01,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:22:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:22:01,502 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-12 02:22:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:22:10,913 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2023-11-12 02:22:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:22:10,917 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-12 02:22:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:22:10,918 INFO L225 Difference]: With dead ends: 70 [2023-11-12 02:22:10,918 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:22:10,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2023-11-12 02:22:10,920 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:22:10,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 224 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-12 02:22:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:22:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:22:10,923 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-12 02:22:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:22:10,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2023-11-12 02:22:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:22:10,924 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:22:10,924 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-12 02:22:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:22:10,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:22:10,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:22:10,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:22:11,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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-12 02:22:11,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:22:16,230 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 39) no Hoare annotation was computed. [2023-11-12 02:22:16,231 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-12 02:22:16,231 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-12 02:22:16,231 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-12 02:22:16,231 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 63 74) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 38) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 29) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 58) no Hoare annotation was computed. [2023-11-12 02:22:16,232 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-12 02:22:16,233 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-12 02:22:16,233 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-12 02:22:16,233 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-12 02:22:16,233 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 59 62) no Hoare annotation was computed. [2023-11-12 02:22:16,233 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-11-12 02:22:16,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:22:16,234 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-12 02:22:16,234 INFO L899 garLoopResultBuilder]: For program point L66-3(lines 66 72) no Hoare annotation was computed. [2023-11-12 02:22:16,234 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-12 02:22:16,234 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-12 02:22:16,235 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-12 02:22:16,235 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:22:16,235 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 40) no Hoare annotation was computed. [2023-11-12 02:22:16,235 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2023-11-12 02:22:16,235 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 41 56) no Hoare annotation was computed. [2023-11-12 02:22:16,235 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-12 02:22:16,235 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-12 02:22:16,236 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-12 02:22:16,236 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-12 02:22:16,236 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-12 02:22:16,236 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-12 02:22:16,236 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-12 02:22:16,240 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-12 02:22:16,242 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:22:16,255 WARN L1567 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-12 02:22:16,256 WARN L1567 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-12 02:22:16,257 WARN L1567 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-12 02:22:16,257 WARN L1567 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-12 02:22:16,257 ERROR L464 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-12 02:22:16,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:22:16 BoogieIcfgContainer [2023-11-12 02:22:16,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:22:16,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:22:16,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:22:16,258 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:22:16,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:46" (3/4) ... [2023-11-12 02:22:16,261 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:22:16,266 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 02:22:16,271 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-12 02:22:16,271 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-12 02:22:16,272 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:22:16,272 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:22:16,354 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:22:16,355 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:22:16,355 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:22:16,356 INFO L158 Benchmark]: Toolchain (without parser) took 30426.20ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 36.3MB in the end (delta: 39.5MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2023-11-12 02:22:16,356 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 71.3MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:22:16,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.10ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 63.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:22:16,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.31ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 62.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:22:16,357 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 60.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:22:16,358 INFO L158 Benchmark]: RCFGBuilder took 432.50ms. Allocated memory is still 100.7MB. Free memory was 60.5MB in the beginning and 76.4MB in the end (delta: -15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:22:16,358 INFO L158 Benchmark]: TraceAbstraction took 29515.97ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 41.0MB in the end (delta: 34.4MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-11-12 02:22:16,359 INFO L158 Benchmark]: Witness Printer took 96.92ms. Allocated memory is still 100.7MB. Free memory was 41.0MB in the beginning and 36.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:22:16,360 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.34ms. Allocated memory is still 71.3MB. Free memory is still 46.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.10ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 63.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.31ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 62.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 60.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 432.50ms. Allocated memory is still 100.7MB. Free memory was 60.5MB in the beginning and 76.4MB in the end (delta: -15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29515.97ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 41.0MB in the end (delta: 34.4MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 96.92ms. Allocated memory is still 100.7MB. Free memory was 41.0MB in the beginning and 36.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. 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 * 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: 29.4s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 779 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 231 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.6s 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, 11 LocationsWithAnnotation, 37 PreInvPairs, 58 NumberOfFragments, 317 HoareAnnotationTreeSize, 37 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 566 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s 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: 66]: Loop Invariant [2023-11-12 02:22:16,382 WARN L1567 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-12 02:22:16,383 WARN L1567 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-12 02:22:16,383 WARN L1567 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-12 02:22:16,383 WARN L1567 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-12 02:22:16,600 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-12 02:22:16,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ec71dbd-20e2-46e4-ad53-aaf128b3e86c/bin/uautomizer-verify-uTZkv6EMXl/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