./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/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_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/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_f5643657-de8f-4c59-b497-49fb8bc04459/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 66787726949481a4f01caef79c3e8fdad3a573b5b9ad657da2a70c5a83f1feb5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:21:01,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:21:01,134 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:21:01,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:21:01,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:21:01,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:21:01,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:21:01,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:21:01,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:21:01,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:21:01,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:21:01,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:21:01,176 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:21:01,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:21:01,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:21:01,178 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:21:01,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:21:01,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:21:01,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:21:01,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:21:01,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:21:01,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:21:01,182 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:21:01,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:21:01,184 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:21:01,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:21:01,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:21:01,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:21:01,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:21:01,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:21:01,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:21:01,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:21:01,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:21:01,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:21:01,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:21:01,190 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:21:01,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:21:01,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:21:01,191 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:21:01,192 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_f5643657-de8f-4c59-b497-49fb8bc04459/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_f5643657-de8f-4c59-b497-49fb8bc04459/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 -> 66787726949481a4f01caef79c3e8fdad3a573b5b9ad657da2a70c5a83f1feb5 [2023-11-06 22:21:01,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:21:01,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:21:01,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:21:01,531 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:21:01,532 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:21:01,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i [2023-11-06 22:21:04,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:21:04,984 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:21:04,984 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i [2023-11-06 22:21:04,997 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/data/14603472b/8e3aab13e7534e8f821955c001f6d37c/FLAG97fad9474 [2023-11-06 22:21:05,012 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/data/14603472b/8e3aab13e7534e8f821955c001f6d37c [2023-11-06 22:21:05,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:21:05,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:21:05,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:05,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:21:05,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:21:05,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3fc28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05, skipping insertion in model container [2023-11-06 22:21:05,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,050 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:21:05,206 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_f5643657-de8f-4c59-b497-49fb8bc04459/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i[915,928] [2023-11-06 22:21:05,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:05,254 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:21:05,271 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_f5643657-de8f-4c59-b497-49fb8bc04459/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-43.i[915,928] [2023-11-06 22:21:05,295 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:21:05,312 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:21:05,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05 WrapperNode [2023-11-06 22:21:05,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:21:05,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:05,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:21:05,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:21:05,320 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:21:05" (1/1) ... [2023-11-06 22:21:05,328 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:21:05" (1/1) ... [2023-11-06 22:21:05,351 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2023-11-06 22:21:05,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:21:05,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:21:05,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:21:05,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:21:05,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:21:05,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:21:05,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:21:05,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:21:05,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (1/1) ... [2023-11-06 22:21:05,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:21:05,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:21:05,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/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:21:05,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/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:21:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:21:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:21:05,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:21:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:21:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:21:05,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:21:05,574 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:21:05,581 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:21:05,778 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:21:05,794 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:21:05,794 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:21:05,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:05 BoogieIcfgContainer [2023-11-06 22:21:05,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:21:05,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:21:05,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:21:05,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:21:05,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:21:05" (1/3) ... [2023-11-06 22:21:05,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b22ce26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:05, skipping insertion in model container [2023-11-06 22:21:05,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:05" (2/3) ... [2023-11-06 22:21:05,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b22ce26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:05, skipping insertion in model container [2023-11-06 22:21:05,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:05" (3/3) ... [2023-11-06 22:21:05,807 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-43.i [2023-11-06 22:21:05,828 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:21:05,829 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:21:05,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:21:05,890 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;@14c1f1f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:21:05,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:21:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:21:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:21:05,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:05,906 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:05,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:05,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2124186055, now seen corresponding path program 1 times [2023-11-06 22:21:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:05,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133611108] [2023-11-06 22:21:05,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:21:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:21:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:21:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:21:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:21:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:21:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:21:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:21:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:21:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 22:21:07,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:07,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133611108] [2023-11-06 22:21:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133611108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:07,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:07,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:21:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161362672] [2023-11-06 22:21:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:07,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:21:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:07,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:21:07,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:21:07,212 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:07,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:07,503 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2023-11-06 22:21:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:21:07,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2023-11-06 22:21:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:07,522 INFO L225 Difference]: With dead ends: 105 [2023-11-06 22:21:07,522 INFO L226 Difference]: Without dead ends: 70 [2023-11-06 22:21:07,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:21:07,532 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:07,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 286 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:21:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-06 22:21:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2023-11-06 22:21:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:21:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-06 22:21:07,605 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2023-11-06 22:21:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:07,607 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-06 22:21:07,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-11-06 22:21:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:21:07,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:07,616 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:07,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:21:07,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:07,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2122339013, now seen corresponding path program 1 times [2023-11-06 22:21:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:07,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137256617] [2023-11-06 22:21:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:07,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:21:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:21:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:21:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:21:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:21:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:21:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:21:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:21:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:21:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 22:21:08,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137256617] [2023-11-06 22:21:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137256617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:08,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:21:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101500325] [2023-11-06 22:21:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:08,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:21:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:21:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:21:08,223 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:08,412 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2023-11-06 22:21:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:21:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2023-11-06 22:21:08,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:08,415 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:21:08,415 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 22:21:08,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:21:08,418 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:08,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 291 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:21:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 22:21:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 37. [2023-11-06 22:21:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:21:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-06 22:21:08,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2023-11-06 22:21:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:08,433 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-06 22:21:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-11-06 22:21:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-06 22:21:08,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:08,435 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:08,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:21:08,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:08,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1880376511, now seen corresponding path program 1 times [2023-11-06 22:21:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496985033] [2023-11-06 22:21:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:21:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:21:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:21:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:21:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:21:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:21:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:21:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:21:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:21:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 22:21:08,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:08,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496985033] [2023-11-06 22:21:08,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496985033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:08,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:08,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:21:08,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830721669] [2023-11-06 22:21:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:08,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:21:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:08,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:21:08,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:21:08,881 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:09,156 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2023-11-06 22:21:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:21:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 66 [2023-11-06 22:21:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:09,159 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:21:09,159 INFO L226 Difference]: Without dead ends: 67 [2023-11-06 22:21:09,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:21:09,161 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 36 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:09,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 320 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:21:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-06 22:21:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2023-11-06 22:21:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:21:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-06 22:21:09,175 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2023-11-06 22:21:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:09,176 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-06 22:21:09,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-11-06 22:21:09,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:21:09,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:09,178 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:21:09,178 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:09,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1602309983, now seen corresponding path program 1 times [2023-11-06 22:21:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:09,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169252943] [2023-11-06 22:21:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:21:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:21:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:21:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:21:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:21:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:21:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:21:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:21:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:21:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 22:21:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:09,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169252943] [2023-11-06 22:21:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169252943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:09,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:21:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158626254] [2023-11-06 22:21:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:09,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:21:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:21:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:21:09,530 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:09,670 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2023-11-06 22:21:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:21:09,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2023-11-06 22:21:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:09,672 INFO L225 Difference]: With dead ends: 74 [2023-11-06 22:21:09,673 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 22:21:09,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:21:09,675 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 34 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:09,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 290 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:21:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 22:21:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 37. [2023-11-06 22:21:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:21:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2023-11-06 22:21:09,687 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 67 [2023-11-06 22:21:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:09,688 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2023-11-06 22:21:09,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2023-11-06 22:21:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-06 22:21:09,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:21:09,690 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:21:09,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:21:09,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:21:09,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1604157025, now seen corresponding path program 1 times [2023-11-06 22:21:09,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:21:09,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123179834] [2023-11-06 22:21:09,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:21:09,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:21:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:21:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:21:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:21:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:21:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:21:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:21:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:21:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:21:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:21:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:21:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:21:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 22:21:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:21:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123179834] [2023-11-06 22:21:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123179834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:21:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:21:09,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:21:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273326849] [2023-11-06 22:21:09,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:21:09,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:21:09,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:21:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:21:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:21:09,968 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:21:10,116 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2023-11-06 22:21:10,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:21:10,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2023-11-06 22:21:10,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:21:10,118 INFO L225 Difference]: With dead ends: 68 [2023-11-06 22:21:10,118 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:21:10,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:21:10,125 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 32 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:21:10,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 341 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:21:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:21:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:21:10,129 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:21:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:21:10,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2023-11-06 22:21:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:21:10,130 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:21:10,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-06 22:21:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:21:10,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:21:10,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:21:10,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:21:10,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:21:10,378 INFO L902 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: true [2023-11-06 22:21:10,378 INFO L902 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: true [2023-11-06 22:21:10,378 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-11-06 22:21:10,380 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:21:10,380 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:21:10,380 INFO L902 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: true [2023-11-06 22:21:10,380 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) [2023-11-06 22:21:10,381 INFO L902 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: true [2023-11-06 22:21:10,381 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 69 80) the Hoare annotation is: false [2023-11-06 22:21:10,381 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-06 22:21:10,381 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 44) no Hoare annotation was computed. [2023-11-06 22:21:10,381 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:21:10,382 INFO L899 garLoopResultBuilder]: For program point L61(lines 46 62) no Hoare annotation was computed. [2023-11-06 22:21:10,382 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:21:10,382 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 29) no Hoare annotation was computed. [2023-11-06 22:21:10,382 INFO L902 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: true [2023-11-06 22:21:10,382 INFO L902 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: true [2023-11-06 22:21:10,383 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:21:10,383 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-11-06 22:21:10,386 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 65 68) the Hoare annotation is: (let ((.cse2 (= (* (div ~var_1_2~0 256) 256) ~var_1_2~0))) (let ((.cse0 (= ~var_1_4~0 ~var_1_1~0)) (.cse3 (* (div ~var_1_4~0 4294967296) 4294967296)) (.cse1 (not (= |ULTIMATE.start_property_#res#1| 0))) (.cse4 (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (.cse5 (not .cse2))) (or (and .cse0 .cse1 .cse2) (and .cse1 (or (and .cse0 (<= (+ .cse3 4) ~var_1_4~0)) (and (<= ~var_1_4~0 (+ .cse3 3)) (= ~var_1_1~0 4))) .cse4 .cse5) (and .cse1 .cse2 (not (= (+ .cse3 ~var_1_5~0) (+ (* (div ~var_1_5~0 4294967296) 4294967296) ~var_1_4~0)))) (and .cse1 (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0) .cse2) (let ((.cse6 (div (+ 64 ~var_1_4~0) 4294967296)) (.cse7 (div ~var_1_1~0 4294967296))) (and (<= .cse6 .cse7) .cse1 (not .cse4) (= (+ ~var_1_1~0 (* .cse6 4294967296)) (+ 64 ~var_1_4~0 (* .cse7 4294967296))) .cse5))))) [2023-11-06 22:21:10,386 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-11-06 22:21:10,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:21:10,386 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-11-06 22:21:10,387 INFO L902 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: true [2023-11-06 22:21:10,387 INFO L902 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: true [2023-11-06 22:21:10,387 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:21:10,387 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 64) no Hoare annotation was computed. [2023-11-06 22:21:10,388 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-06 22:21:10,388 INFO L902 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: true [2023-11-06 22:21:10,388 INFO L902 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: true [2023-11-06 22:21:10,388 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-06 22:21:10,388 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 30 45) no Hoare annotation was computed. [2023-11-06 22:21:10,389 INFO L902 garLoopResultBuilder]: At program point L72-2(lines 72 78) the Hoare annotation is: true [2023-11-06 22:21:10,389 INFO L899 garLoopResultBuilder]: For program point L72-3(lines 72 78) no Hoare annotation was computed. [2023-11-06 22:21:10,389 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:21:10,389 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:21:10,389 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:21:10,390 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:21:10,393 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:21:10,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:21:10,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:21:10 BoogieIcfgContainer [2023-11-06 22:21:10,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:21:10,435 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:21:10,435 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:21:10,435 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:21:10,436 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:05" (3/4) ... [2023-11-06 22:21:10,439 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:21:10,443 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:21:10,451 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:21:10,452 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:21:10,452 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:21:10,453 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:21:10,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((var_1_4 == var_1_1) && !((\result == 0))) && (((var_1_2 / 256) * 256) == var_1_2)) || (((!((\result == 0)) && (((var_1_4 == var_1_1) && ((((var_1_4 / 4294967296) * 4294967296) + 4) <= var_1_4)) || ((var_1_4 <= (((var_1_4 / 4294967296) * 4294967296) + 3)) && (var_1_1 == 4)))) && (var_1_3 == (256 * (var_1_3 / 256)))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || ((!((\result == 0)) && (((var_1_2 / 256) * 256) == var_1_2)) && !(((((var_1_4 / 4294967296) * 4294967296) + var_1_5) == (((var_1_5 / 4294967296) * 4294967296) + var_1_4))))) || ((!((\result == 0)) && ((256 * (var_1_6 / 256)) == var_1_6)) && (((var_1_2 / 256) * 256) == var_1_2))) || (((((((64 + var_1_4) / 4294967296) <= (var_1_1 / 4294967296)) && !((\result == 0))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && ((var_1_1 + (((64 + var_1_4) / 4294967296) * 4294967296)) == ((64 + var_1_4) + ((var_1_1 / 4294967296) * 4294967296)))) && !((((var_1_2 / 256) * 256) == var_1_2)))) [2023-11-06 22:21:10,517 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((var_1_4 == var_1_1) && !((\result == 0))) && (((var_1_2 / 256) * 256) == var_1_2)) || (((!((\result == 0)) && (((var_1_4 == var_1_1) && ((((var_1_4 / 4294967296) * 4294967296) + 4) <= var_1_4)) || ((var_1_4 <= (((var_1_4 / 4294967296) * 4294967296) + 3)) && (var_1_1 == 4)))) && (var_1_3 == (256 * (var_1_3 / 256)))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || ((!((\result == 0)) && (((var_1_2 / 256) * 256) == var_1_2)) && !(((((var_1_4 / 4294967296) * 4294967296) + var_1_5) == (((var_1_5 / 4294967296) * 4294967296) + var_1_4))))) || ((!((\result == 0)) && ((256 * (var_1_6 / 256)) == var_1_6)) && (((var_1_2 / 256) * 256) == var_1_2))) || (((((((64 + var_1_4) / 4294967296) <= (var_1_1 / 4294967296)) && !((\result == 0))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && ((var_1_1 + (((64 + var_1_4) / 4294967296) * 4294967296)) == ((64 + var_1_4) + ((var_1_1 / 4294967296) * 4294967296)))) && !((((var_1_2 / 256) * 256) == var_1_2)))) [2023-11-06 22:21:10,539 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:21:10,552 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:21:10,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:21:10,554 INFO L158 Benchmark]: Toolchain (without parser) took 5537.24ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 106.5MB in the beginning and 152.9MB in the end (delta: -46.5MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2023-11-06 22:21:10,556 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:21:10,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.25ms. Allocated memory is still 153.1MB. Free memory was 106.5MB in the beginning and 95.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:21:10,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.26ms. Allocated memory is still 153.1MB. Free memory was 95.0MB in the beginning and 93.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:21:10,559 INFO L158 Benchmark]: Boogie Preprocessor took 27.12ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 92.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:21:10,559 INFO L158 Benchmark]: RCFGBuilder took 416.36ms. Allocated memory is still 153.1MB. Free memory was 92.3MB in the beginning and 80.1MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:21:10,560 INFO L158 Benchmark]: TraceAbstraction took 4634.60ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 79.2MB in the beginning and 54.0MB in the end (delta: 25.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2023-11-06 22:21:10,561 INFO L158 Benchmark]: Witness Printer took 117.82ms. Allocated memory is still 184.5MB. Free memory was 54.0MB in the beginning and 152.9MB in the end (delta: -99.0MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2023-11-06 22:21:10,565 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.25ms. Allocated memory is still 153.1MB. Free memory was 106.5MB in the beginning and 95.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.26ms. Allocated memory is still 153.1MB. Free memory was 95.0MB in the beginning and 93.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.12ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 92.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.36ms. Allocated memory is still 153.1MB. Free memory was 92.3MB in the beginning and 80.1MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4634.60ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 79.2MB in the beginning and 54.0MB in the end (delta: 25.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 117.82ms. Allocated memory is still 184.5MB. Free memory was 54.0MB in the beginning and 152.9MB in the end (delta: -99.0MB). Peak memory consumption was 5.8MB. 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 1528 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1115 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 219 IncrementalHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 413 mSDtfsCounter, 219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 53, 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, 129 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 44 PreInvPairs, 73 NumberOfFragments, 175 HoareAnnotationTreeSize, 44 FomulaSimplifications, 5927 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 54 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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: 69]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((var_1_4 == var_1_1) && !((\result == 0))) && (((var_1_2 / 256) * 256) == var_1_2)) || (((!((\result == 0)) && (((var_1_4 == var_1_1) && ((((var_1_4 / 4294967296) * 4294967296) + 4) <= var_1_4)) || ((var_1_4 <= (((var_1_4 / 4294967296) * 4294967296) + 3)) && (var_1_1 == 4)))) && (var_1_3 == (256 * (var_1_3 / 256)))) && !((((var_1_2 / 256) * 256) == var_1_2)))) || ((!((\result == 0)) && (((var_1_2 / 256) * 256) == var_1_2)) && !(((((var_1_4 / 4294967296) * 4294967296) + var_1_5) == (((var_1_5 / 4294967296) * 4294967296) + var_1_4))))) || ((!((\result == 0)) && ((256 * (var_1_6 / 256)) == var_1_6)) && (((var_1_2 / 256) * 256) == var_1_2))) || (((((((64 + var_1_4) / 4294967296) <= (var_1_1 / 4294967296)) && !((\result == 0))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && ((var_1_1 + (((64 + var_1_4) / 4294967296) * 4294967296)) == ((64 + var_1_4) + ((var_1_1 / 4294967296) * 4294967296)))) && !((((var_1_2 / 256) * 256) == var_1_2)))) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: !((cond == 0)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:21:10,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5643657-de8f-4c59-b497-49fb8bc04459/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