./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.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_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/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_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/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_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/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 eac3468c0f4088651ddf076a06043d0b9c6e6e24604d04dedd9321326c1496b7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:16:59,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:16:59,132 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:16:59,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:16:59,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:16:59,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:16:59,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:16:59,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:16:59,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:16:59,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:16:59,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:16:59,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:16:59,201 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:16:59,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:16:59,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:16:59,204 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:16:59,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:16:59,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:16:59,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:16:59,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:16:59,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:16:59,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:16:59,207 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:16:59,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:16:59,208 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:16:59,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:16:59,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:16:59,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:16:59,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:16:59,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:16:59,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:16:59,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:16:59,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:16:59,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:16:59,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:16:59,214 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:16:59,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:16:59,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:16:59,215 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:16:59,215 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_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/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_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/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 -> eac3468c0f4088651ddf076a06043d0b9c6e6e24604d04dedd9321326c1496b7 [2023-11-06 22:16:59,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:16:59,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:16:59,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:16:59,632 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:16:59,633 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:16:59,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i [2023-11-06 22:17:02,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:17:03,062 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:17:03,063 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i [2023-11-06 22:17:03,071 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/data/fb489b2a7/997b0ee276a54921bf475d2e1c8a0b86/FLAG945df964a [2023-11-06 22:17:03,086 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/data/fb489b2a7/997b0ee276a54921bf475d2e1c8a0b86 [2023-11-06 22:17:03,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:17:03,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:17:03,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:03,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:17:03,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:17:03,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b9bde1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03, skipping insertion in model container [2023-11-06 22:17:03,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,147 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:17:03,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_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i[915,928] [2023-11-06 22:17:03,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:03,418 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:17:03,434 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_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-36.i[915,928] [2023-11-06 22:17:03,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:17:03,481 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:17:03,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03 WrapperNode [2023-11-06 22:17:03,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:17:03,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:03,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:17:03,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:17:03,491 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:17:03" (1/1) ... [2023-11-06 22:17:03,509 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:17:03" (1/1) ... [2023-11-06 22:17:03,543 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2023-11-06 22:17:03,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:17:03,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:17:03,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:17:03,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:17:03,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:17:03,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:17:03,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:17:03,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:17:03,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (1/1) ... [2023-11-06 22:17:03,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:17:03,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:17:03,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/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:17:03,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/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:17:03,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:17:03,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:17:03,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:17:03,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:17:03,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:17:03,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:17:03,757 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:17:03,759 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:17:03,970 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:17:03,977 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:17:03,977 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:17:03,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:03 BoogieIcfgContainer [2023-11-06 22:17:03,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:17:03,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:17:03,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:17:03,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:17:03,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:17:03" (1/3) ... [2023-11-06 22:17:03,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548f5cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:03, skipping insertion in model container [2023-11-06 22:17:03,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:17:03" (2/3) ... [2023-11-06 22:17:03,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548f5cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:17:03, skipping insertion in model container [2023-11-06 22:17:03,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:03" (3/3) ... [2023-11-06 22:17:03,990 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-36.i [2023-11-06 22:17:04,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:17:04,011 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:17:04,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:17:04,076 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;@654a87fd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:17:04,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:17:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:17:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:17:04,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:04,095 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:04,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:04,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash 897699725, now seen corresponding path program 1 times [2023-11-06 22:17:04,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287370723] [2023-11-06 22:17:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:17:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:17:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:17:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:17:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:17:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:17:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:17:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:17:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:17:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:17:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:17:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:17:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:17:04,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:04,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287370723] [2023-11-06 22:17:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287370723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:17:04,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397397939] [2023-11-06 22:17:04,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:04,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:17:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:04,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:17:04,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:17:04,561 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:17:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:04,610 INFO L93 Difference]: Finished difference Result 77 states and 126 transitions. [2023-11-06 22:17:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:17:04,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2023-11-06 22:17:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:04,621 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:17:04,622 INFO L226 Difference]: Without dead ends: 38 [2023-11-06 22:17:04,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:17:04,632 INFO L413 NwaCegarLoop]: 53 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, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:04,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:17:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-06 22:17:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-06 22:17:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:17:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2023-11-06 22:17:04,692 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 78 [2023-11-06 22:17:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:04,699 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2023-11-06 22:17:04,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:17:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2023-11-06 22:17:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:17:04,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:04,706 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:04,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:17:04,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:04,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:04,711 INFO L85 PathProgramCache]: Analyzing trace with hash -557582451, now seen corresponding path program 1 times [2023-11-06 22:17:04,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:04,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180204445] [2023-11-06 22:17:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:17:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:17:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:17:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:17:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:17:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:17:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:17:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:17:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:17:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:17:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:17:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:17:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:17:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180204445] [2023-11-06 22:17:05,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180204445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:05,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:05,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:17:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38520404] [2023-11-06 22:17:05,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:05,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:17:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:05,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:17:05,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:17:05,936 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:17:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:06,327 INFO L93 Difference]: Finished difference Result 79 states and 116 transitions. [2023-11-06 22:17:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:17:06,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-11-06 22:17:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:06,334 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:17:06,334 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:17:06,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:17:06,342 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 53 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:06,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 305 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:17:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:17:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45. [2023-11-06 22:17:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:17:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2023-11-06 22:17:06,359 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 78 [2023-11-06 22:17:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:06,360 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2023-11-06 22:17:06,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:17:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2023-11-06 22:17:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-06 22:17:06,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:17:06,363 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:17:06,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:17:06,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:17:06,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:17:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1217424911, now seen corresponding path program 1 times [2023-11-06 22:17:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:17:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627585656] [2023-11-06 22:17:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:17:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:17:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:17:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:17:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:17:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:17:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:17:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:17:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:17:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:17:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:17:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:17:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:17:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:17:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:17:06,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:17:06,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:17:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627585656] [2023-11-06 22:17:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627585656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:17:06,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:17:06,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:17:06,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145493623] [2023-11-06 22:17:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:17:06,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:17:06,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:17:06,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:17:06,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:17:06,939 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:17:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:17:07,384 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2023-11-06 22:17:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:17:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-11-06 22:17:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:17:07,388 INFO L225 Difference]: With dead ends: 76 [2023-11-06 22:17:07,388 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:17:07,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:17:07,400 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 85 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:17:07,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 227 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:17:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:17:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:17:07,404 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:17:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:17:07,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2023-11-06 22:17:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:17:07,406 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:17:07,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:17:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:17:07,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:17:07,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:17:07,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:17:07,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:17:07,642 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 35 37) no Hoare annotation was computed. [2023-11-06 22:17:07,643 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-11-06 22:17:07,643 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2023-11-06 22:17:07,643 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-11-06 22:17:07,643 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-06 22:17:07,643 INFO L902 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: true [2023-11-06 22:17:07,644 INFO L902 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: true [2023-11-06 22:17:07,644 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:17:07,644 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:17:07,644 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse2 (* 256 (div ~var_1_1~0 256)))) (let ((.cse0 (= ~var_1_1~0 .cse2)) (.cse1 (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0))) (and (<= 1 |ULTIMATE.start_property_#res#1|) (or .cse0 (= ~var_1_8~0 ~var_1_7~0) .cse1 (< ~var_1_5~0 ~var_1_3~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|) (or (< (+ ~var_1_4~0 ~var_1_3~0 ~last_1_var_1_7~0) ~var_1_2~0) (and (or .cse0 .cse1) (or (= (+ .cse2 1) ~var_1_1~0) (not .cse1))))))) [2023-11-06 22:17:07,645 INFO L895 garLoopResultBuilder]: At program point L77-2(lines 77 83) the Hoare annotation is: (let ((.cse2 (* 256 (div ~var_1_1~0 256)))) (let ((.cse0 (= ~var_1_1~0 .cse2)) (.cse1 (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0))) (and (or .cse0 (= ~var_1_8~0 ~var_1_7~0) .cse1 (< ~var_1_5~0 ~var_1_3~0)) (or (< (+ ~var_1_4~0 ~var_1_3~0 ~last_1_var_1_7~0) ~var_1_2~0) (and (or .cse0 .cse1) (or (= (+ .cse2 1) ~var_1_1~0) (not .cse1))))))) [2023-11-06 22:17:07,645 INFO L899 garLoopResultBuilder]: For program point L77-3(lines 77 83) no Hoare annotation was computed. [2023-11-06 22:17:07,645 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 74 85) the Hoare annotation is: false [2023-11-06 22:17:07,645 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-11-06 22:17:07,646 INFO L899 garLoopResultBuilder]: For program point L65(lines 47 66) no Hoare annotation was computed. [2023-11-06 22:17:07,646 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:17:07,647 INFO L902 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: true [2023-11-06 22:17:07,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:17:07,647 INFO L902 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: true [2023-11-06 22:17:07,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:17:07,647 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-06 22:17:07,648 INFO L902 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2023-11-06 22:17:07,648 INFO L902 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: true [2023-11-06 22:17:07,648 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 70 73) the Hoare annotation is: (let ((.cse2 (* 256 (div ~var_1_1~0 256)))) (let ((.cse0 (= ~var_1_1~0 .cse2)) (.cse1 (= (* 256 (div ~var_1_6~0 256)) ~var_1_6~0))) (and (<= 1 |ULTIMATE.start_property_#res#1|) (or .cse0 (= ~var_1_8~0 ~var_1_7~0) .cse1 (< ~var_1_5~0 ~var_1_3~0)) (or (< (+ ~var_1_4~0 ~var_1_3~0 ~last_1_var_1_7~0) ~var_1_2~0) (and (or .cse0 .cse1) (or (= (+ .cse2 1) ~var_1_1~0) (not .cse1))))))) [2023-11-06 22:17:07,648 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-11-06 22:17:07,648 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 46) no Hoare annotation was computed. [2023-11-06 22:17:07,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:17:07,649 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-06 22:17:07,649 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2023-11-06 22:17:07,649 INFO L902 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: true [2023-11-06 22:17:07,649 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-06 22:17:07,649 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:17:07,651 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 69) no Hoare annotation was computed. [2023-11-06 22:17:07,652 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-06 22:17:07,652 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2023-11-06 22:17:07,655 INFO L902 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: true [2023-11-06 22:17:07,656 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 45) no Hoare annotation was computed. [2023-11-06 22:17:07,656 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-11-06 22:17:07,656 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:17:07,656 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:17:07,656 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:17:07,656 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:17:07,659 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 22:17:07,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:17:07,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:17:07 BoogieIcfgContainer [2023-11-06 22:17:07,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:17:07,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:17:07,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:17:07,694 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:17:07,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:17:03" (3/4) ... [2023-11-06 22:17:07,698 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:17:07,701 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:17:07,705 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:17:07,706 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:17:07,706 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:17:07,707 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:17:07,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= \result) && ((((var_1_1 == (256 * (var_1_1 / 256))) || (var_1_8 == var_1_7)) || ((256 * (var_1_6 / 256)) == var_1_6)) || (var_1_5 < var_1_3))) && ((((var_1_4 + var_1_3) + last_1_var_1_7) < var_1_2) || (((var_1_1 == (256 * (var_1_1 / 256))) || ((256 * (var_1_6 / 256)) == var_1_6)) && ((((256 * (var_1_1 / 256)) + 1) == var_1_1) || !(((256 * (var_1_6 / 256)) == var_1_6)))))) [2023-11-06 22:17:07,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= \result) && ((((var_1_1 == (256 * (var_1_1 / 256))) || (var_1_8 == var_1_7)) || ((256 * (var_1_6 / 256)) == var_1_6)) || (var_1_5 < var_1_3))) && (1 <= cond)) && ((((var_1_4 + var_1_3) + last_1_var_1_7) < var_1_2) || (((var_1_1 == (256 * (var_1_1 / 256))) || ((256 * (var_1_6 / 256)) == var_1_6)) && ((((256 * (var_1_1 / 256)) + 1) == var_1_1) || !(((256 * (var_1_6 / 256)) == var_1_6)))))) [2023-11-06 22:17:07,780 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((1 <= \result) && ((((var_1_1 == (256 * (var_1_1 / 256))) || (var_1_8 == var_1_7)) || ((256 * (var_1_6 / 256)) == var_1_6)) || (var_1_5 < var_1_3))) && ((((var_1_4 + var_1_3) + last_1_var_1_7) < var_1_2) || (((var_1_1 == (256 * (var_1_1 / 256))) || ((256 * (var_1_6 / 256)) == var_1_6)) && ((((256 * (var_1_1 / 256)) + 1) == var_1_1) || !(((256 * (var_1_6 / 256)) == var_1_6)))))) [2023-11-06 22:17:07,780 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= \result) && ((((var_1_1 == (256 * (var_1_1 / 256))) || (var_1_8 == var_1_7)) || ((256 * (var_1_6 / 256)) == var_1_6)) || (var_1_5 < var_1_3))) && (1 <= cond)) && ((((var_1_4 + var_1_3) + last_1_var_1_7) < var_1_2) || (((var_1_1 == (256 * (var_1_1 / 256))) || ((256 * (var_1_6 / 256)) == var_1_6)) && ((((256 * (var_1_1 / 256)) + 1) == var_1_1) || !(((256 * (var_1_6 / 256)) == var_1_6)))))) [2023-11-06 22:17:07,798 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:17:07,798 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:17:07,798 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:17:07,799 INFO L158 Benchmark]: Toolchain (without parser) took 4708.84ms. Allocated memory was 153.1MB in the beginning and 192.9MB in the end (delta: 39.8MB). Free memory was 110.9MB in the beginning and 115.8MB in the end (delta: -4.9MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,800 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:17:07,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.06ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 117.2MB in the end (delta: -6.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.67ms. Allocated memory is still 153.1MB. Free memory was 117.2MB in the beginning and 115.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,801 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 114.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,801 INFO L158 Benchmark]: RCFGBuilder took 384.08ms. Allocated memory is still 153.1MB. Free memory was 114.0MB in the beginning and 101.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,802 INFO L158 Benchmark]: TraceAbstraction took 3709.79ms. Allocated memory was 153.1MB in the beginning and 192.9MB in the end (delta: 39.8MB). Free memory was 101.3MB in the beginning and 120.0MB in the end (delta: -18.7MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,802 INFO L158 Benchmark]: Witness Printer took 105.66ms. Allocated memory is still 192.9MB. Free memory was 120.0MB in the beginning and 115.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:17:07,806 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.31ms. Allocated memory is still 109.1MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.06ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 117.2MB in the end (delta: -6.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.67ms. Allocated memory is still 153.1MB. Free memory was 117.2MB in the beginning and 115.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 153.1MB. Free memory was 115.5MB in the beginning and 114.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.08ms. Allocated memory is still 153.1MB. Free memory was 114.0MB in the beginning and 101.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3709.79ms. Allocated memory was 153.1MB in the beginning and 192.9MB in the end (delta: 39.8MB). Free memory was 101.3MB in the beginning and 120.0MB in the end (delta: -18.7MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Witness Printer took 105.66ms. Allocated memory is still 192.9MB. Free memory was 120.0MB in the beginning and 115.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 585 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 388 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 210 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 197 mSDtfsCounter, 210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 3 MinimizatonAttempts, 32 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 52 PreInvPairs, 81 NumberOfFragments, 212 HoareAnnotationTreeSize, 52 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 156 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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: 77]: Loop Invariant Derived loop invariant: (((((var_1_1 == (256 * (var_1_1 / 256))) || (var_1_8 == var_1_7)) || ((256 * (var_1_6 / 256)) == var_1_6)) || (var_1_5 < var_1_3)) && ((((var_1_4 + var_1_3) + last_1_var_1_7) < var_1_2) || (((var_1_1 == (256 * (var_1_1 / 256))) || ((256 * (var_1_6 / 256)) == var_1_6)) && ((((256 * (var_1_1 / 256)) + 1) == var_1_1) || !(((256 * (var_1_6 / 256)) == var_1_6)))))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: (((1 <= \result) && ((((var_1_1 == (256 * (var_1_1 / 256))) || (var_1_8 == var_1_7)) || ((256 * (var_1_6 / 256)) == var_1_6)) || (var_1_5 < var_1_3))) && ((((var_1_4 + var_1_3) + last_1_var_1_7) < var_1_2) || (((var_1_1 == (256 * (var_1_1 / 256))) || ((256 * (var_1_6 / 256)) == var_1_6)) && ((((256 * (var_1_1 / 256)) + 1) == var_1_1) || !(((256 * (var_1_6 / 256)) == var_1_6)))))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((1 <= \result) && ((((var_1_1 == (256 * (var_1_1 / 256))) || (var_1_8 == var_1_7)) || ((256 * (var_1_6 / 256)) == var_1_6)) || (var_1_5 < var_1_3))) && (1 <= cond)) && ((((var_1_4 + var_1_3) + last_1_var_1_7) < var_1_2) || (((var_1_1 == (256 * (var_1_1 / 256))) || ((256 * (var_1_6 / 256)) == var_1_6)) && ((((256 * (var_1_1 / 256)) + 1) == var_1_1) || !(((256 * (var_1_6 / 256)) == var_1_6)))))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:17:07,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72c34943-bd45-4dac-8a4e-d4459dbb5fdc/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