./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.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_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/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_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/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_051f4889-7f37-4b49-ad42-df9660df8b27/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 0774421f7ba176c3cd99ed79363ce4f8b6083c8c0f33805bbcb720d76b34f63e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:02:25,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:02:25,336 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:02:25,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:02:25,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:02:25,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:02:25,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:02:25,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:02:25,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:02:25,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:02:25,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:02:25,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:02:25,375 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:02:25,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:02:25,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:02:25,379 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:02:25,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:02:25,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:02:25,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:02:25,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:02:25,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:02:25,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:02:25,386 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:02:25,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:02:25,387 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:02:25,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:02:25,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:02:25,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:02:25,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:02:25,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:02:25,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:02:25,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:02:25,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:02:25,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:02:25,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:02:25,393 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:02:25,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:02:25,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:02:25,394 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:02:25,394 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_051f4889-7f37-4b49-ad42-df9660df8b27/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_051f4889-7f37-4b49-ad42-df9660df8b27/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 -> 0774421f7ba176c3cd99ed79363ce4f8b6083c8c0f33805bbcb720d76b34f63e [2023-11-06 23:02:25,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:02:25,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:02:25,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:02:25,775 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:02:25,777 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:02:25,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i [2023-11-06 23:02:28,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:02:29,058 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:02:29,058 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i [2023-11-06 23:02:29,067 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/data/3e692cd5e/4480d0194af24ae993ca4ac95af50869/FLAGb27eaca91 [2023-11-06 23:02:29,087 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/data/3e692cd5e/4480d0194af24ae993ca4ac95af50869 [2023-11-06 23:02:29,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:02:29,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:02:29,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:02:29,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:02:29,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:02:29,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcdd7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29, skipping insertion in model container [2023-11-06 23:02:29,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,131 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:02:29,284 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_051f4889-7f37-4b49-ad42-df9660df8b27/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i[915,928] [2023-11-06 23:02:29,330 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:02:29,342 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:02:29,356 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_051f4889-7f37-4b49-ad42-df9660df8b27/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-13.i[915,928] [2023-11-06 23:02:29,390 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:02:29,422 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:02:29,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29 WrapperNode [2023-11-06 23:02:29,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:02:29,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:02:29,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:02:29,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:02:29,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,514 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2023-11-06 23:02:29,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:02:29,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:02:29,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:02:29,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:02:29,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:02:29,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:02:29,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:02:29,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:02:29,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (1/1) ... [2023-11-06 23:02:29,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:02:29,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:29,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:02:29,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:02:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:02:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 23:02:29,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 23:02:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:02:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:02:29,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:02:29,797 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:02:29,799 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:02:30,205 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:02:30,217 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:02:30,217 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:02:30,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:02:30 BoogieIcfgContainer [2023-11-06 23:02:30,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:02:30,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:02:30,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:02:30,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:02:30,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:02:29" (1/3) ... [2023-11-06 23:02:30,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f91fa31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:02:30, skipping insertion in model container [2023-11-06 23:02:30,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:29" (2/3) ... [2023-11-06 23:02:30,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f91fa31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:02:30, skipping insertion in model container [2023-11-06 23:02:30,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:02:30" (3/3) ... [2023-11-06 23:02:30,240 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-13.i [2023-11-06 23:02:30,259 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:02:30,259 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:02:30,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:02:30,318 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;@7de690b2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:02:30,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:02:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:02:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 23:02:30,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:30,336 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:30,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:30,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1494661314, now seen corresponding path program 1 times [2023-11-06 23:02:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:30,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674824227] [2023-11-06 23:02:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:02:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:02:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:02:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:02:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:02:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:02:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:02:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:02:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:02:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:02:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:02:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:02:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:02:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:02:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:02:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:02:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:02:30,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:30,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674824227] [2023-11-06 23:02:30,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674824227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:30,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:30,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:02:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956878635] [2023-11-06 23:02:30,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:30,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:02:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:30,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:02:30,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:02:30,886 INFO L87 Difference]: Start difference. First operand has 47 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:02:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:30,915 INFO L93 Difference]: Finished difference Result 87 states and 146 transitions. [2023-11-06 23:02:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:02:30,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2023-11-06 23:02:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:30,926 INFO L225 Difference]: With dead ends: 87 [2023-11-06 23:02:30,926 INFO L226 Difference]: Without dead ends: 43 [2023-11-06 23:02:30,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:02:30,934 INFO L413 NwaCegarLoop]: 61 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, 61 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 23:02:30,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:02:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-06 23:02:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-06 23:02:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:02:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2023-11-06 23:02:30,999 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 101 [2023-11-06 23:02:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:31,002 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2023-11-06 23:02:31,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 23:02:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2023-11-06 23:02:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 23:02:31,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:31,010 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:31,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:02:31,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:31,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash 410412862, now seen corresponding path program 1 times [2023-11-06 23:02:31,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:31,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101799407] [2023-11-06 23:02:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:02:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:02:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:02:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:02:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:02:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:02:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:02:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:02:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:02:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:02:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:02:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:02:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:02:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:02:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:02:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:02:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:02:31,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:31,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101799407] [2023-11-06 23:02:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101799407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:31,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:02:31,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779022273] [2023-11-06 23:02:31,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:31,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:02:31,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:02:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:02:31,263 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:02:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:31,308 INFO L93 Difference]: Finished difference Result 113 states and 164 transitions. [2023-11-06 23:02:31,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:02:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-06 23:02:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:31,317 INFO L225 Difference]: With dead ends: 113 [2023-11-06 23:02:31,317 INFO L226 Difference]: Without dead ends: 73 [2023-11-06 23:02:31,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 23:02:31,320 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 54 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:31,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:02:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-06 23:02:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2023-11-06 23:02:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:02:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2023-11-06 23:02:31,346 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 101 [2023-11-06 23:02:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:31,350 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2023-11-06 23:02:31,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:02:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2023-11-06 23:02:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 23:02:31,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:31,355 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:31,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:02:31,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:31,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:31,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2109547072, now seen corresponding path program 1 times [2023-11-06 23:02:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22236206] [2023-11-06 23:02:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:02:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:02:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:02:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:02:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:02:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:02:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:02:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:02:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:02:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:02:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:02:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:02:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:02:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:02:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:02:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:02:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:02:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:31,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22236206] [2023-11-06 23:02:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22236206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:02:31,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569876263] [2023-11-06 23:02:31,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:31,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:02:31,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:02:31,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:02:31,889 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:02:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:31,937 INFO L93 Difference]: Finished difference Result 83 states and 115 transitions. [2023-11-06 23:02:31,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:02:31,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-06 23:02:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:31,942 INFO L225 Difference]: With dead ends: 83 [2023-11-06 23:02:31,943 INFO L226 Difference]: Without dead ends: 43 [2023-11-06 23:02:31,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 23:02:31,948 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:31,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:02:31,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-06 23:02:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-06 23:02:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:02:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2023-11-06 23:02:31,966 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 101 [2023-11-06 23:02:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:31,967 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2023-11-06 23:02:31,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:02:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2023-11-06 23:02:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 23:02:31,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:31,970 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:31,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:02:31,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:31,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2052288770, now seen corresponding path program 1 times [2023-11-06 23:02:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:31,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617770035] [2023-11-06 23:02:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:31,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 23:02:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:02:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 23:02:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 23:02:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 23:02:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 23:02:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 23:02:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 23:02:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 23:02:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:02:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:02:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:02:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 23:02:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 23:02:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 23:02:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:02:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 23:02:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617770035] [2023-11-06 23:02:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617770035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:43,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:43,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:02:43,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167545664] [2023-11-06 23:02:43,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:43,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:02:43,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:43,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:02:43,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:02:43,712 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:02:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:44,237 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2023-11-06 23:02:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:02:44,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2023-11-06 23:02:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:44,239 INFO L225 Difference]: With dead ends: 82 [2023-11-06 23:02:44,239 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:02:44,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:02:44,241 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:44,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 362 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:02:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:02:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:02:44,243 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 23:02:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:02:44,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2023-11-06 23:02:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:44,244 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:02:44,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 23:02:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:02:44,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:02:44,246 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:02:44,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:02:44,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:02:44,799 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-06 23:02:44,800 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,800 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,800 INFO L895 garLoopResultBuilder]: At program point L93-2(lines 93 99) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,801 INFO L899 garLoopResultBuilder]: For program point L93-3(lines 93 99) no Hoare annotation was computed. [2023-11-06 23:02:44,801 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 23:02:44,801 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 23:02:44,801 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,801 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,807 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse6 (* ~var_1_11~0 65535)) (.cse7 (div ~var_1_11~0 256))) (let ((.cse0 (+ (* 256 (div ~var_1_15~0 256)) ~var_1_20~0)) (.cse3 (* .cse7 256)) (.cse1 (div ~var_1_1~0 65536)) (.cse5 (div ~var_1_7~0 65536)) (.cse4 (div (+ .cse6 ~var_1_8~0 (* .cse7 (- 16776960))) 65536))) (and (<= 25 ~var_1_1~0) (<= .cse0 ~var_1_15~0) (not (= |ULTIMATE.start_property_#res#1| 0)) (= ~var_1_1~0 (+ (* .cse1 65536) ~var_1_19~0)) (let ((.cse2 (+ .cse3 ~var_1_6~0))) (or (and (= ~var_1_6~0 ~var_1_10~0) (<= .cse2 ~var_1_11~0)) (and (<= (+ ~var_1_11~0 1) .cse2) (= (+ .cse3 ~var_1_10~0) ~var_1_11~0)))) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (= (+ (* 256 (div (+ ~var_1_13~0 ~var_1_12~0) 256)) ~var_1_11~0) (+ .cse3 ~var_1_13~0 ~var_1_12~0)) (<= (+ (* 65536 (div ~var_1_20~0 65536)) ~var_1_15~0) .cse0) (<= (+ .cse3 .cse4) (+ (div ~var_1_8~0 65536) ~var_1_11~0 .cse5)) (<= .cse1 0) (<= 0 ~var_1_20~0) (= (* (div ~var_1_18~0 256) 256) ~var_1_18~0) (= (+ .cse6 ~var_1_8~0 (* 65536 .cse5)) (+ ~var_1_7~0 (* 65536 .cse4) (* .cse7 16776960)))))) [2023-11-06 23:02:44,807 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 40 57) no Hoare annotation was computed. [2023-11-06 23:02:44,807 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-11-06 23:02:44,808 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 90 101) the Hoare annotation is: false [2023-11-06 23:02:44,808 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 57) no Hoare annotation was computed. [2023-11-06 23:02:44,808 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,808 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,808 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:02:44,809 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-06 23:02:44,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:02:44,809 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 23:02:44,809 INFO L899 garLoopResultBuilder]: For program point L82(lines 58 83) no Hoare annotation was computed. [2023-11-06 23:02:44,809 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,810 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 86 89) the Hoare annotation is: (let ((.cse6 (* ~var_1_11~0 65535)) (.cse7 (div ~var_1_11~0 256))) (let ((.cse0 (+ (* 256 (div ~var_1_15~0 256)) ~var_1_20~0)) (.cse3 (* .cse7 256)) (.cse1 (div ~var_1_1~0 65536)) (.cse5 (div ~var_1_7~0 65536)) (.cse4 (div (+ .cse6 ~var_1_8~0 (* .cse7 (- 16776960))) 65536))) (and (<= 25 ~var_1_1~0) (<= .cse0 ~var_1_15~0) (not (= |ULTIMATE.start_property_#res#1| 0)) (= ~var_1_1~0 (+ (* .cse1 65536) ~var_1_19~0)) (let ((.cse2 (+ .cse3 ~var_1_6~0))) (or (and (= ~var_1_6~0 ~var_1_10~0) (<= .cse2 ~var_1_11~0)) (and (<= (+ ~var_1_11~0 1) .cse2) (= (+ .cse3 ~var_1_10~0) ~var_1_11~0)))) (= (+ (* 256 (div (+ ~var_1_13~0 ~var_1_12~0) 256)) ~var_1_11~0) (+ .cse3 ~var_1_13~0 ~var_1_12~0)) (<= (+ (* 65536 (div ~var_1_20~0 65536)) ~var_1_15~0) .cse0) (<= (+ .cse3 .cse4) (+ (div ~var_1_8~0 65536) ~var_1_11~0 .cse5)) (<= .cse1 0) (<= 0 ~var_1_20~0) (= (* (div ~var_1_18~0 256) 256) ~var_1_18~0) (= (+ .cse6 ~var_1_8~0 (* 65536 .cse5)) (+ ~var_1_7~0 (* 65536 .cse4) (* .cse7 16776960)))))) [2023-11-06 23:02:44,810 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,811 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-06 23:02:44,813 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,813 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:02:44,814 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-06 23:02:44,814 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,814 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,814 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:02:44,815 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2023-11-06 23:02:44,815 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-06 23:02:44,815 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,815 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,815 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 85) no Hoare annotation was computed. [2023-11-06 23:02:44,816 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 53) no Hoare annotation was computed. [2023-11-06 23:02:44,816 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-06 23:02:44,816 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-11-06 23:02:44,816 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 40 57) no Hoare annotation was computed. [2023-11-06 23:02:44,816 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,817 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (and (<= 25 ~var_1_1~0) (<= (div ~var_1_1~0 65536) 0)) [2023-11-06 23:02:44,817 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 23:02:44,817 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 23:02:44,817 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 23:02:44,817 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 23:02:44,821 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 23:02:44,823 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:02:44,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:02:44 BoogieIcfgContainer [2023-11-06 23:02:44,845 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:02:44,846 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:02:44,846 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:02:44,846 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:02:44,847 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:02:30" (3/4) ... [2023-11-06 23:02:44,849 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:02:44,853 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 23:02:44,859 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 23:02:44,860 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:02:44,860 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:02:44,860 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:02:44,891 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((25 <= var_1_1) && (((256 * (var_1_15 / 256)) + var_1_20) <= var_1_15)) && !((\result == 0))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && (((65536 * (var_1_20 / 65536)) + var_1_15) <= ((256 * (var_1_15 / 256)) + var_1_20))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (0 <= var_1_20)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) [2023-11-06 23:02:44,891 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((25 <= var_1_1) && (((256 * (var_1_15 / 256)) + var_1_20) <= var_1_15)) && !((\result == 0))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && !((cond == 0))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && (((65536 * (var_1_20 / 65536)) + var_1_15) <= ((256 * (var_1_15 / 256)) + var_1_20))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (0 <= var_1_20)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) [2023-11-06 23:02:44,915 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((25 <= var_1_1) && (((256 * (var_1_15 / 256)) + var_1_20) <= var_1_15)) && !((\result == 0))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && (((65536 * (var_1_20 / 65536)) + var_1_15) <= ((256 * (var_1_15 / 256)) + var_1_20))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (0 <= var_1_20)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) [2023-11-06 23:02:44,916 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((25 <= var_1_1) && (((256 * (var_1_15 / 256)) + var_1_20) <= var_1_15)) && !((\result == 0))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && !((cond == 0))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && (((65536 * (var_1_20 / 65536)) + var_1_15) <= ((256 * (var_1_15 / 256)) + var_1_20))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (0 <= var_1_20)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) [2023-11-06 23:02:44,927 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:02:44,928 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:02:44,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:02:44,929 INFO L158 Benchmark]: Toolchain (without parser) took 15834.70ms. Allocated memory was 146.8MB in the beginning and 350.2MB in the end (delta: 203.4MB). Free memory was 105.7MB in the beginning and 309.0MB in the end (delta: -203.2MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2023-11-06 23:02:44,929 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 146.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:02:44,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.48ms. Allocated memory is still 146.8MB. Free memory was 105.4MB in the beginning and 92.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 23:02:44,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.21ms. Allocated memory is still 146.8MB. Free memory was 92.9MB in the beginning and 89.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:02:44,930 INFO L158 Benchmark]: Boogie Preprocessor took 70.06ms. Allocated memory is still 146.8MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:02:44,931 INFO L158 Benchmark]: RCFGBuilder took 633.38ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 87.1MB in the beginning and 167.1MB in the end (delta: -79.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-11-06 23:02:44,931 INFO L158 Benchmark]: TraceAbstraction took 14611.02ms. Allocated memory was 199.2MB in the beginning and 350.2MB in the end (delta: 151.0MB). Free memory was 167.2MB in the beginning and 313.1MB in the end (delta: -145.9MB). Peak memory consumption was 209.5MB. Max. memory is 16.1GB. [2023-11-06 23:02:44,932 INFO L158 Benchmark]: Witness Printer took 82.07ms. Allocated memory is still 350.2MB. Free memory was 313.1MB in the beginning and 309.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:02:44,934 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 146.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.48ms. Allocated memory is still 146.8MB. Free memory was 105.4MB in the beginning and 92.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.21ms. Allocated memory is still 146.8MB. Free memory was 92.9MB in the beginning and 89.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.06ms. Allocated memory is still 146.8MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 633.38ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 87.1MB in the beginning and 167.1MB in the end (delta: -79.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14611.02ms. Allocated memory was 199.2MB in the beginning and 350.2MB in the end (delta: 151.0MB). Free memory was 167.2MB in the beginning and 313.1MB in the end (delta: -145.9MB). Peak memory consumption was 209.5MB. Max. memory is 16.1GB. * Witness Printer took 82.07ms. Allocated memory is still 350.2MB. Free memory was 313.1MB in the beginning and 309.0MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 625 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 320 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 305 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 30 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 100 PreInvPairs, 136 NumberOfFragments, 495 HoareAnnotationTreeSize, 100 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 1021 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((((((((25 <= var_1_1) && (((256 * (var_1_15 / 256)) + var_1_20) <= var_1_15)) && !((\result == 0))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && (((65536 * (var_1_20 / 65536)) + var_1_15) <= ((256 * (var_1_15 / 256)) + var_1_20))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (0 <= var_1_20)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((25 <= var_1_1) && ((var_1_1 / 65536) <= 0)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((((((((25 <= var_1_1) && (((256 * (var_1_15 / 256)) + var_1_20) <= var_1_15)) && !((\result == 0))) && (var_1_1 == (((var_1_1 / 65536) * 65536) + var_1_19))) && (((var_1_6 == var_1_10) && ((((var_1_11 / 256) * 256) + var_1_6) <= var_1_11)) || (((var_1_11 + 1) <= (((var_1_11 / 256) * 256) + var_1_6)) && ((((var_1_11 / 256) * 256) + var_1_10) == var_1_11)))) && !((cond == 0))) && (((256 * ((var_1_13 + var_1_12) / 256)) + var_1_11) == ((((var_1_11 / 256) * 256) + var_1_13) + var_1_12))) && (((65536 * (var_1_20 / 65536)) + var_1_15) <= ((256 * (var_1_15 / 256)) + var_1_20))) && ((((var_1_11 / 256) * 256) + ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536)) <= (((var_1_8 / 65536) + var_1_11) + (var_1_7 / 65536)))) && ((var_1_1 / 65536) <= 0)) && (0 <= var_1_20)) && (((var_1_18 / 256) * 256) == var_1_18)) && ((((var_1_11 * 65535) + var_1_8) + (65536 * (var_1_7 / 65536))) == ((var_1_7 + (65536 * ((((var_1_11 * 65535) + var_1_8) + ((var_1_11 / 256) * -16776960)) / 65536))) + ((var_1_11 / 256) * 16776960)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:02:44,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_051f4889-7f37-4b49-ad42-df9660df8b27/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