./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d087495e6d69ce7df2bae3361f922b107889d83ae1996f23275d822283a5c40d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:35:06,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:35:06,829 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:35:06,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:35:06,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:35:06,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:35:06,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:35:06,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:35:06,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:35:06,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:35:06,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:35:06,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:35:06,870 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:35:06,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:35:06,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:35:06,872 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:35:06,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:35:06,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:35:06,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:35:06,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:35:06,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:35:06,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:35:06,877 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:35:06,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:35:06,879 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:35:06,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:35:06,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:35:06,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:35:06,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:06,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:35:06,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:35:06,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:35:06,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:35:06,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:35:06,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:35:06,885 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:35:06,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:35:06,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:35:06,886 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:35:06,887 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_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d087495e6d69ce7df2bae3361f922b107889d83ae1996f23275d822283a5c40d [2023-11-06 22:35:07,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:35:07,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:35:07,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:35:07,219 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:35:07,220 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:35:07,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2023-11-06 22:35:10,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:11,083 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:11,084 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2023-11-06 22:35:11,104 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/data/c25d1fee3/d213d35e07f84a19b21b94e70e458106/FLAG209aad6a6 [2023-11-06 22:35:11,129 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/data/c25d1fee3/d213d35e07f84a19b21b94e70e458106 [2023-11-06 22:35:11,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:11,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:11,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:11,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:11,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:11,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e38a451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11, skipping insertion in model container [2023-11-06 22:35:11,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,196 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:11,450 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_fbfa0000-5d77-4312-bba5-3f85c2b92899/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i[915,928] [2023-11-06 22:35:11,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:11,507 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:11,525 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_fbfa0000-5d77-4312-bba5-3f85c2b92899/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i[915,928] [2023-11-06 22:35:11,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:11,563 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:11,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11 WrapperNode [2023-11-06 22:35:11,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:11,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:11,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:11,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:11,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,626 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2023-11-06 22:35:11,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:11,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:11,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:11,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:11,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:11,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:11,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:11,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:11,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (1/1) ... [2023-11-06 22:35:11,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:11,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:11,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:35:11,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:35:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:11,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:35:11,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:35:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:35:11,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:11,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:11,862 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:11,866 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:12,193 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:12,214 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:12,215 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:35:12,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:12 BoogieIcfgContainer [2023-11-06 22:35:12,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:12,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:12,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:12,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:12,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:11" (1/3) ... [2023-11-06 22:35:12,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b704f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:12, skipping insertion in model container [2023-11-06 22:35:12,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:11" (2/3) ... [2023-11-06 22:35:12,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b704f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:12, skipping insertion in model container [2023-11-06 22:35:12,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:12" (3/3) ... [2023-11-06 22:35:12,243 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-13.i [2023-11-06 22:35:12,274 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:12,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:35:12,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:12,389 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2cf84497, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:12,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:35:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:35:12,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:12,409 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:12,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:12,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:12,417 INFO L85 PathProgramCache]: Analyzing trace with hash -246350692, now seen corresponding path program 1 times [2023-11-06 22:35:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:12,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407905700] [2023-11-06 22:35:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:12,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:35:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:35:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:35:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:35:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:35:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:35:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:35:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:35:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:35:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:35:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407905700] [2023-11-06 22:35:12,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407905700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:12,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:12,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:35:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734851884] [2023-11-06 22:35:12,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:12,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:35:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:12,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:35:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:35:12,940 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:35:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:12,976 INFO L93 Difference]: Finished difference Result 83 states and 136 transitions. [2023-11-06 22:35:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:35:12,979 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2023-11-06 22:35:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:13,002 INFO L225 Difference]: With dead ends: 83 [2023-11-06 22:35:13,003 INFO L226 Difference]: Without dead ends: 41 [2023-11-06 22:35:13,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:35:13,011 INFO L413 NwaCegarLoop]: 58 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, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:13,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-06 22:35:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-06 22:35:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-11-06 22:35:13,073 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 78 [2023-11-06 22:35:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:13,074 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-11-06 22:35:13,074 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:35:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-11-06 22:35:13,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:35:13,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:13,081 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:13,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:35:13,082 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:13,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1701632868, now seen corresponding path program 1 times [2023-11-06 22:35:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905267721] [2023-11-06 22:35:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:35:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:35:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:35:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:35:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:35:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:35:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:35:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:35:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:35:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:35:13,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:13,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905267721] [2023-11-06 22:35:13,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905267721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:13,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:13,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:13,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129507439] [2023-11-06 22:35:13,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:13,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:13,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:13,525 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:13,630 INFO L93 Difference]: Finished difference Result 72 states and 105 transitions. [2023-11-06 22:35:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-11-06 22:35:13,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:13,635 INFO L225 Difference]: With dead ends: 72 [2023-11-06 22:35:13,635 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:35:13,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:35:13,638 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 20 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:13,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 349 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:35:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 44. [2023-11-06 22:35:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2023-11-06 22:35:13,664 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 78 [2023-11-06 22:35:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:13,665 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-11-06 22:35:13,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2023-11-06 22:35:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-06 22:35:13,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:13,671 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:13,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:35:13,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:13,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1481029495, now seen corresponding path program 1 times [2023-11-06 22:35:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733619890] [2023-11-06 22:35:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:35:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:35:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:35:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:35:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:35:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:35:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:35:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:35:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:35:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:35:13,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733619890] [2023-11-06 22:35:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733619890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:13,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:35:13,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54801911] [2023-11-06 22:35:13,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:13,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:35:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:13,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:35:13,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:13,885 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:13,918 INFO L93 Difference]: Finished difference Result 90 states and 125 transitions. [2023-11-06 22:35:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:35:13,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2023-11-06 22:35:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:13,921 INFO L225 Difference]: With dead ends: 90 [2023-11-06 22:35:13,922 INFO L226 Difference]: Without dead ends: 49 [2023-11-06 22:35:13,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:13,925 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:13,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-06 22:35:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2023-11-06 22:35:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2023-11-06 22:35:13,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 80 [2023-11-06 22:35:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:13,941 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2023-11-06 22:35:13,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2023-11-06 22:35:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-06 22:35:13,946 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:13,946 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:13,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:35:13,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:13,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 208770161, now seen corresponding path program 1 times [2023-11-06 22:35:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:13,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213411104] [2023-11-06 22:35:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:13,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:35:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:35:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:35:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:35:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:35:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:35:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:35:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:35:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:35:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:35:15,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213411104] [2023-11-06 22:35:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213411104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:15,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:35:15,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125605435] [2023-11-06 22:35:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:15,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:35:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:35:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:35:15,477 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:16,160 INFO L93 Difference]: Finished difference Result 110 states and 150 transitions. [2023-11-06 22:35:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:35:16,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-11-06 22:35:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:16,170 INFO L225 Difference]: With dead ends: 110 [2023-11-06 22:35:16,171 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 22:35:16,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:35:16,179 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 61 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:16,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 622 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:35:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 22:35:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 67. [2023-11-06 22:35:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.22) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:35:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2023-11-06 22:35:16,210 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 82 [2023-11-06 22:35:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:16,210 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2023-11-06 22:35:16,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2023-11-06 22:35:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-06 22:35:16,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:16,213 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:16,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:35:16,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:16,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:16,214 INFO L85 PathProgramCache]: Analyzing trace with hash 266028463, now seen corresponding path program 1 times [2023-11-06 22:35:16,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:16,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965981607] [2023-11-06 22:35:16,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:16,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:35:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:35:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:35:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:35:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:35:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:35:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:35:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:35:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:35:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:35:16,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:16,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965981607] [2023-11-06 22:35:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965981607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:16,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:16,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:35:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701738007] [2023-11-06 22:35:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:16,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:35:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:16,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:35:16,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:16,319 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:16,385 INFO L93 Difference]: Finished difference Result 153 states and 202 transitions. [2023-11-06 22:35:16,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:35:16,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-11-06 22:35:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:16,391 INFO L225 Difference]: With dead ends: 153 [2023-11-06 22:35:16,391 INFO L226 Difference]: Without dead ends: 89 [2023-11-06 22:35:16,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:16,399 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:16,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 117 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-06 22:35:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2023-11-06 22:35:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.1875) internal successors, (76), 66 states have internal predecessors, (76), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:35:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2023-11-06 22:35:16,437 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 82 [2023-11-06 22:35:16,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:16,440 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2023-11-06 22:35:16,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2023-11-06 22:35:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-06 22:35:16,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:16,450 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:16,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:35:16,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:16,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash -184256849, now seen corresponding path program 1 times [2023-11-06 22:35:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:16,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46180947] [2023-11-06 22:35:16,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:16,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:35:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:35:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:35:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:35:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:35:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:35:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:35:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:35:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:35:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:35:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:35:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:35:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46180947] [2023-11-06 22:35:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46180947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:16,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:35:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979924446] [2023-11-06 22:35:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:16,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:35:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:16,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:35:16,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:16,621 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:16,680 INFO L93 Difference]: Finished difference Result 187 states and 241 transitions. [2023-11-06 22:35:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:35:16,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2023-11-06 22:35:16,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:16,690 INFO L225 Difference]: With dead ends: 187 [2023-11-06 22:35:16,690 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 22:35:16,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:16,692 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 28 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:16,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 22:35:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2023-11-06 22:35:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 62 states have internal predecessors, (70), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:35:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2023-11-06 22:35:16,713 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 82 [2023-11-06 22:35:16,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:16,714 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2023-11-06 22:35:16,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2023-11-06 22:35:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-06 22:35:16,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:16,716 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:16,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:35:16,717 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:16,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash -126998547, now seen corresponding path program 1 times [2023-11-06 22:35:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:16,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759355902] [2023-11-06 22:35:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:16,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:16,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:35:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:16,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:35:16,831 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:35:16,832 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:35:16,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:35:16,839 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:16,843 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:35:16,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:35:16 BoogieIcfgContainer [2023-11-06 22:35:16,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:35:16,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:35:16,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:35:16,930 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:35:16,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:12" (3/4) ... [2023-11-06 22:35:16,934 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:35:16,935 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:35:16,936 INFO L158 Benchmark]: Toolchain (without parser) took 5789.83ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 109.0MB in the beginning and 59.9MB in the end (delta: 49.2MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,936 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 100.7MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:16,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.92ms. Allocated memory is still 144.7MB. Free memory was 108.9MB in the beginning and 97.6MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.66ms. Allocated memory is still 144.7MB. Free memory was 97.6MB in the beginning and 95.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,937 INFO L158 Benchmark]: Boogie Preprocessor took 39.59ms. Allocated memory is still 144.7MB. Free memory was 95.5MB in the beginning and 94.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:16,938 INFO L158 Benchmark]: RCFGBuilder took 554.78ms. Allocated memory is still 144.7MB. Free memory was 94.4MB in the beginning and 81.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,938 INFO L158 Benchmark]: TraceAbstraction took 4702.97ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 81.2MB in the beginning and 59.9MB in the end (delta: 21.4MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,939 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 174.1MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:16,941 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.41ms. Allocated memory is still 100.7MB. Free memory is still 51.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.92ms. Allocated memory is still 144.7MB. Free memory was 108.9MB in the beginning and 97.6MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.66ms. Allocated memory is still 144.7MB. Free memory was 97.6MB in the beginning and 95.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.59ms. Allocated memory is still 144.7MB. Free memory was 95.5MB in the beginning and 94.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 554.78ms. Allocated memory is still 144.7MB. Free memory was 94.4MB in the beginning and 81.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4702.97ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 81.2MB in the beginning and 59.9MB in the end (delta: 21.4MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 174.1MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned short int var_1_3 = 256; [L25] signed long int var_1_4 = 500; [L26] signed char var_1_5 = 16; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 1; VAL [isInitial=0, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L73] isInitial = 1 [L74] FCALL initially() [L75] COND TRUE 1 [L76] FCALL updateLastVariables() [L77] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L50] var_1_3 = __VERIFIER_nondet_ushort() [L51] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L51] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L52] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L52] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L53] var_1_4 = __VERIFIER_nondet_long() [L54] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=16, var_1_6=1, var_1_7=1] [L54] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=16, var_1_6=1, var_1_7=1] [L55] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=16, var_1_6=1, var_1_7=1] [L55] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=16, var_1_6=1, var_1_7=1] [L56] var_1_5 = __VERIFIER_nondet_char() [L57] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L57] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L58] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L58] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L59] var_1_6 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L60] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L61] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L61] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L62] var_1_7 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L63] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L64] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L64] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L77] RET updateVariables() [L78] CALL step() [L32] signed long int stepLocal_1 = ~ var_1_3; [L33] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L34] COND TRUE \read(var_1_2) VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L35] EXPR var_1_4 >> var_1_5 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4 >> var_1_5=-1, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L35] COND FALSE !(stepLocal_1 != (var_1_4 >> var_1_5)) [L42] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L78] RET step() [L79] CALL, EXPR property() [L69] EXPR var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L69] EXPR var_1_4 >> var_1_5 VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4 >> var_1_5=2147483646, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L69] EXPR var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 VAL [isInitial=1, var_1_1=32, var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1=0, var_1_2=1, var_1_3=0, var_1_4 >> var_1_5=2147483646, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L69-L70] return var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 ; [L79] RET, EXPR property() [L79] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=2147483647, var_1_5=32, var_1_6=1, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 1362 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 913 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 449 mSDtfsCounter, 275 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=5, 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 95 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1584/1584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:35:16,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d087495e6d69ce7df2bae3361f922b107889d83ae1996f23275d822283a5c40d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:35:20,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:35:20,590 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:35:20,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:35:20,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:35:20,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:35:20,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:35:20,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:35:20,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:35:20,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:35:20,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:35:20,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:35:20,672 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:35:20,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:35:20,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:35:20,676 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:35:20,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:35:20,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:35:20,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:35:20,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:35:20,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:35:20,680 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:35:20,681 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:35:20,681 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:35:20,682 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:35:20,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:35:20,683 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:35:20,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:35:20,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:35:20,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:35:20,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:20,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:35:20,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:35:20,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:35:20,688 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:35:20,688 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:35:20,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:35:20,688 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:35:20,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:35:20,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:35:20,690 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:35:20,691 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:35:20,691 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_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d087495e6d69ce7df2bae3361f922b107889d83ae1996f23275d822283a5c40d [2023-11-06 22:35:21,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:35:21,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:35:21,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:35:21,260 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:35:21,260 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:35:21,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2023-11-06 22:35:25,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:25,420 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:25,420 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2023-11-06 22:35:25,431 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/data/2678f285b/bc0d96f3931444a8b24877a062ec8ab7/FLAG1434fb9b6 [2023-11-06 22:35:25,449 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/data/2678f285b/bc0d96f3931444a8b24877a062ec8ab7 [2023-11-06 22:35:25,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:25,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:25,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:25,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:25,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:25,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4fb4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25, skipping insertion in model container [2023-11-06 22:35:25,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,503 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:25,679 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_fbfa0000-5d77-4312-bba5-3f85c2b92899/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i[915,928] [2023-11-06 22:35:25,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:25,739 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:25,764 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_fbfa0000-5d77-4312-bba5-3f85c2b92899/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-13.i[915,928] [2023-11-06 22:35:25,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:25,820 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:25,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25 WrapperNode [2023-11-06 22:35:25,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:25,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:25,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:25,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:25,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,906 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2023-11-06 22:35:25,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:25,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:25,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:25,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:25,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:25,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:25,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:25,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:25,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (1/1) ... [2023-11-06 22:35:25,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:25,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:25,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:35:26,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:35:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:35:26,042 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:35:26,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:35:26,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:26,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:26,136 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:26,139 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:26,371 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:26,379 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:26,379 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:35:26,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:26 BoogieIcfgContainer [2023-11-06 22:35:26,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:26,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:26,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:26,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:26,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:25" (1/3) ... [2023-11-06 22:35:26,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d97b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:26, skipping insertion in model container [2023-11-06 22:35:26,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:25" (2/3) ... [2023-11-06 22:35:26,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d97b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:26, skipping insertion in model container [2023-11-06 22:35:26,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:26" (3/3) ... [2023-11-06 22:35:26,445 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-13.i [2023-11-06 22:35:26,503 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:26,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:35:26,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:26,592 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c81dd03, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:26,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:35:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:35:26,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:26,619 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:26,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:26,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1561146326, now seen corresponding path program 1 times [2023-11-06 22:35:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:35:26,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728318815] [2023-11-06 22:35:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:26,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:26,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:35:26,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:35:26,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:35:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:26,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:35:26,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2023-11-06 22:35:26,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:35:26,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:35:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728318815] [2023-11-06 22:35:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728318815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:26,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:26,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:35:26,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627644915] [2023-11-06 22:35:26,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:26,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:35:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:35:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:35:26,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:35:26,989 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:35:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:27,048 INFO L93 Difference]: Finished difference Result 73 states and 120 transitions. [2023-11-06 22:35:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:35:27,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2023-11-06 22:35:27,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:27,063 INFO L225 Difference]: With dead ends: 73 [2023-11-06 22:35:27,063 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:35:27,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:35:27,075 INFO L413 NwaCegarLoop]: 50 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, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:27,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:35:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-06 22:35:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2023-11-06 22:35:27,150 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 76 [2023-11-06 22:35:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:27,151 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2023-11-06 22:35:27,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:35:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2023-11-06 22:35:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:35:27,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:27,163 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:27,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:27,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:27,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:27,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2036403158, now seen corresponding path program 1 times [2023-11-06 22:35:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:35:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083420023] [2023-11-06 22:35:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:27,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:27,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:35:27,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:35:27,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:35:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:27,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:35:27,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:35:29,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:35:29,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:35:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083420023] [2023-11-06 22:35:29,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083420023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:29,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:29,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092679733] [2023-11-06 22:35:29,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:29,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:29,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:35:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:29,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:29,083 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:29,221 INFO L93 Difference]: Finished difference Result 67 states and 96 transitions. [2023-11-06 22:35:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:35:29,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2023-11-06 22:35:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:29,226 INFO L225 Difference]: With dead ends: 67 [2023-11-06 22:35:29,226 INFO L226 Difference]: Without dead ends: 65 [2023-11-06 22:35:29,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:29,229 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 23 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:29,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 303 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:35:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-06 22:35:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2023-11-06 22:35:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2023-11-06 22:35:29,247 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 76 [2023-11-06 22:35:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:29,248 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2023-11-06 22:35:29,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2023-11-06 22:35:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 22:35:29,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:29,252 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:29,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:29,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:29,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:29,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:29,469 INFO L85 PathProgramCache]: Analyzing trace with hash 890523356, now seen corresponding path program 1 times [2023-11-06 22:35:29,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:35:29,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093658717] [2023-11-06 22:35:29,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:29,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:29,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:35:29,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:35:29,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:35:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:29,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:35:29,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:35:30,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:35:30,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:35:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093658717] [2023-11-06 22:35:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093658717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:30,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:30,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:35:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802524259] [2023-11-06 22:35:30,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:30,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:35:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:35:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:35:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:35:30,132 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:30,548 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2023-11-06 22:35:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:35:30,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2023-11-06 22:35:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:30,552 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:35:30,553 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 22:35:30,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:35:30,555 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 32 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:30,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 335 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:35:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 22:35:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2023-11-06 22:35:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2023-11-06 22:35:30,568 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 77 [2023-11-06 22:35:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:30,569 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2023-11-06 22:35:30,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2023-11-06 22:35:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:35:30,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:30,572 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:30,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:30,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:30,788 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:30,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1598089375, now seen corresponding path program 1 times [2023-11-06 22:35:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:35:30,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850249269] [2023-11-06 22:35:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:30,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:30,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:35:30,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:35:30,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:35:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:30,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:35:30,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-06 22:35:31,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:35:31,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:35:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850249269] [2023-11-06 22:35:31,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850249269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:31,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:35:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511889040] [2023-11-06 22:35:31,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:31,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:35:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:35:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:35:31,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:35:31,508 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:33,014 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2023-11-06 22:35:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:35:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-11-06 22:35:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:33,018 INFO L225 Difference]: With dead ends: 81 [2023-11-06 22:35:33,018 INFO L226 Difference]: Without dead ends: 79 [2023-11-06 22:35:33,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:35:33,021 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 71 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:33,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 236 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:35:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-06 22:35:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 43. [2023-11-06 22:35:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:35:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2023-11-06 22:35:33,038 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 78 [2023-11-06 22:35:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:33,039 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2023-11-06 22:35:33,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2023-11-06 22:35:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:35:33,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:33,042 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:35:33,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:33,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:33,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:33,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:33,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1599936417, now seen corresponding path program 1 times [2023-11-06 22:35:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:35:33,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504018012] [2023-11-06 22:35:33,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:33,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:33,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:35:33,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:35:33,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:35:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:33,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-06 22:35:33,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:35:33,828 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-06 22:35:33,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:35:33,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:35:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504018012] [2023-11-06 22:35:33,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504018012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:33,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:33,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:35:33,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841633183] [2023-11-06 22:35:33,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:33,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:35:33,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:35:33,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:35:33,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:35:33,832 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:35,004 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2023-11-06 22:35:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:35:35,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-11-06 22:35:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:35,006 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:35:35,006 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:35:35,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:35:35,009 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 71 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:35,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 221 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:35:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:35:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:35:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:35:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:35:35,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2023-11-06 22:35:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:35,011 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:35:35,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:35:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:35:35,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:35:35,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:35:35,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:35:35,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:35:35,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:35:35,535 INFO L899 garLoopResultBuilder]: For program point L64(lines 46 65) no Hoare annotation was computed. [2023-11-06 22:35:35,535 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 45) no Hoare annotation was computed. [2023-11-06 22:35:35,535 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,536 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,536 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-11-06 22:35:35,536 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:35:35,536 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:35:35,536 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,536 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,537 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,537 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 72 83) the Hoare annotation is: false [2023-11-06 22:35:35,537 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-11-06 22:35:35,537 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:35:35,537 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-06 22:35:35,537 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:35:35,537 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,537 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,538 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:35:35,538 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-11-06 22:35:35,538 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 68 71) the Hoare annotation is: (let ((.cse5 (= ~var_1_1~0 ~var_1_5~0)) (.cse0 (= |ULTIMATE.start_property_#res#1| (_ bv1 32))) (.cse4 (= ~var_1_6~0 (_ bv0 8))) (.cse3 (= ~var_1_7~0 (_ bv0 8)))) (or (and (let ((.cse1 ((_ sign_extend 24) ~var_1_5~0))) (let ((.cse2 (= (bvashr ~var_1_4~0 .cse1) (bvnot ((_ zero_extend 16) ~var_1_3~0))))) (or (and .cse0 (= ~var_1_1~0 ((_ extract 7 0) (bvadd .cse1 (_ bv64 32)))) (not .cse2) (or (not .cse3) (not .cse4))) (and .cse5 .cse0 .cse2) (and (= ~var_1_2~0 (_ bv0 8)) .cse0)))) (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32))) (and .cse5 .cse0 .cse4 .cse3))) [2023-11-06 22:35:35,538 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 67) no Hoare annotation was computed. [2023-11-06 22:35:35,538 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:35:35,539 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 30) no Hoare annotation was computed. [2023-11-06 22:35:35,539 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-11-06 22:35:35,539 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,539 INFO L895 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,552 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:35:35,552 INFO L895 garLoopResultBuilder]: At program point L75-2(lines 75 81) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,553 INFO L899 garLoopResultBuilder]: For program point L75-3(lines 75 81) no Hoare annotation was computed. [2023-11-06 22:35:35,553 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 44) no Hoare annotation was computed. [2023-11-06 22:35:35,553 INFO L902 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: true [2023-11-06 22:35:35,553 INFO L902 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: true [2023-11-06 22:35:35,556 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-06 22:35:35,556 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,557 INFO L895 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_7~0) (_ bv1 32)) [2023-11-06 22:35:35,557 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 43) no Hoare annotation was computed. [2023-11-06 22:35:35,557 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:35:35,557 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:35:35,557 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:35:35,558 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:35:35,561 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:35:35,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:35:35,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:35:35 BoogieIcfgContainer [2023-11-06 22:35:35,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:35:35,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:35:35,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:35:35,584 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:35:35,585 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:26" (3/4) ... [2023-11-06 22:35:35,588 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:35:35,593 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:35:35,603 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:35:35,603 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 22:35:35,604 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:35:35,604 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:35:35,635 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 1) && (var_1_1 == (((var_1_5 + 64) % 4294967296) & 127))) && !(((var_1_4 >> var_1_5) == ~(var_1_3)))) && (!((var_1_7 == 0)) || !((var_1_6 == 0)))) || (((var_1_1 == var_1_5) && (\result == 1)) && ((var_1_4 >> var_1_5) == ~(var_1_3)))) || ((var_1_2 == 0) && (\result == 1))) && (var_1_7 <= 1)) || ((((var_1_1 == var_1_5) && (\result == 1)) && (var_1_6 == 0)) && (var_1_7 == 0))) [2023-11-06 22:35:35,662 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 1) && (var_1_1 == (((var_1_5 + 64) % 4294967296) & 127))) && !(((var_1_4 >> var_1_5) == ~(var_1_3)))) && (!((var_1_7 == 0)) || !((var_1_6 == 0)))) || (((var_1_1 == var_1_5) && (\result == 1)) && ((var_1_4 >> var_1_5) == ~(var_1_3)))) || ((var_1_2 == 0) && (\result == 1))) && (var_1_7 <= 1)) || ((((var_1_1 == var_1_5) && (\result == 1)) && (var_1_6 == 0)) && (var_1_7 == 0))) [2023-11-06 22:35:35,677 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:35:35,677 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:35:35,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:35:35,678 INFO L158 Benchmark]: Toolchain (without parser) took 10224.59ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 87.2MB in the beginning and 133.0MB in the end (delta: -45.8MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-11-06 22:35:35,679 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 79.7MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:35,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.94ms. Allocated memory is still 111.1MB. Free memory was 86.9MB in the beginning and 75.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:35:35,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.55ms. Allocated memory is still 111.1MB. Free memory was 75.3MB in the beginning and 73.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:35,680 INFO L158 Benchmark]: Boogie Preprocessor took 41.76ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:35,681 INFO L158 Benchmark]: RCFGBuilder took 431.58ms. Allocated memory is still 111.1MB. Free memory was 72.0MB in the beginning and 59.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:35:35,681 INFO L158 Benchmark]: TraceAbstraction took 9198.03ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 58.9MB in the beginning and 137.2MB in the end (delta: -78.3MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2023-11-06 22:35:35,682 INFO L158 Benchmark]: Witness Printer took 93.78ms. Allocated memory is still 161.5MB. Free memory was 137.2MB in the beginning and 133.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:35:35,684 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 79.7MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.94ms. Allocated memory is still 111.1MB. Free memory was 86.9MB in the beginning and 75.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.55ms. Allocated memory is still 111.1MB. Free memory was 75.3MB in the beginning and 73.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.76ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.58ms. Allocated memory is still 111.1MB. Free memory was 72.0MB in the beginning and 59.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9198.03ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 58.9MB in the beginning and 137.2MB in the end (delta: -78.3MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * Witness Printer took 93.78ms. Allocated memory is still 161.5MB. Free memory was 137.2MB in the beginning and 133.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 1145 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 824 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1049 IncrementalHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 321 mSDtfsCounter, 1049 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=4, InterpolantAutomatonStates: 61, 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, 5 MinimizatonAttempts, 92 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 52 PreInvPairs, 82 NumberOfFragments, 123 HoareAnnotationTreeSize, 52 FomulaSimplifications, 838 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 110 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 599 SizeOfPredicates, 47 NumberOfNonLiveVariables, 624 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1320/1320 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: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((\result == 1) && (var_1_1 == (((var_1_5 + 64) % 4294967296) & 127))) && !(((var_1_4 >> var_1_5) == ~(var_1_3)))) && (!((var_1_7 == 0)) || !((var_1_6 == 0)))) || (((var_1_1 == var_1_5) && (\result == 1)) && ((var_1_4 >> var_1_5) == ~(var_1_3)))) || ((var_1_2 == 0) && (\result == 1))) && (var_1_7 <= 1)) || ((((var_1_1 == var_1_5) && (\result == 1)) && (var_1_6 == 0)) && (var_1_7 == 0))) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (var_1_7 <= 1) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (var_1_7 <= 1) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:35:35,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbfa0000-5d77-4312-bba5-3f85c2b92899/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE