./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/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_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-39.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/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_0b6bafcf-438d-42c2-8b78-744146395279/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 78de43592ca6b7d37ead12b175005a08c5eee56c1070f4d73c349a7f62011e20 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:14:14,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:14:14,292 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:14:14,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:14:14,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:14:14,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:14:14,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:14:14,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:14:14,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:14:14,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:14:14,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:14:14,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:14:14,339 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:14:14,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:14:14,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:14:14,342 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:14:14,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:14:14,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:14:14,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:14:14,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:14:14,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:14:14,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:14:14,345 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:14:14,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:14:14,346 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:14:14,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:14:14,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:14:14,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:14:14,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:14,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:14:14,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:14:14,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:14:14,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:14:14,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:14:14,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:14:14,351 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:14:14,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:14:14,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:14:14,352 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:14:14,352 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_0b6bafcf-438d-42c2-8b78-744146395279/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_0b6bafcf-438d-42c2-8b78-744146395279/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 -> 78de43592ca6b7d37ead12b175005a08c5eee56c1070f4d73c349a7f62011e20 [2023-11-06 22:14:14,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:14:14,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:14:14,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:14:14,742 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:14:14,742 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:14:14,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-39.i [2023-11-06 22:14:17,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:14:18,189 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:14:18,190 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-39.i [2023-11-06 22:14:18,198 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/data/e14dd1d4a/631f906549304490b8b811d44f6c17c2/FLAG42b21dd86 [2023-11-06 22:14:18,214 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/data/e14dd1d4a/631f906549304490b8b811d44f6c17c2 [2023-11-06 22:14:18,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:14:18,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:14:18,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:18,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:14:18,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:14:18,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9775ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18, skipping insertion in model container [2023-11-06 22:14:18,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,252 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:14:18,400 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_0b6bafcf-438d-42c2-8b78-744146395279/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-39.i[915,928] [2023-11-06 22:14:18,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:18,437 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:14:18,450 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-39.i[915,928] [2023-11-06 22:14:18,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:18,478 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:14:18,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18 WrapperNode [2023-11-06 22:14:18,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:18,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:18,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:14:18,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:14:18,488 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:14:18" (1/1) ... [2023-11-06 22:14:18,496 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:14:18" (1/1) ... [2023-11-06 22:14:18,524 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2023-11-06 22:14:18,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:18,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:14:18,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:14:18,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:14:18,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:14:18,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:14:18,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:14:18,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:14:18,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (1/1) ... [2023-11-06 22:14:18,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:18,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:18,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/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:14:18,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/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:14:18,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:14:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:14:18,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:14:18,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:14:18,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:14:18,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:14:18,720 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:14:18,722 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:14:18,958 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:14:18,969 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:14:18,969 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:14:18,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:18 BoogieIcfgContainer [2023-11-06 22:14:18,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:14:18,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:14:18,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:14:18,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:14:18,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:14:18" (1/3) ... [2023-11-06 22:14:18,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7251ae36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:18, skipping insertion in model container [2023-11-06 22:14:18,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:18" (2/3) ... [2023-11-06 22:14:18,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7251ae36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:18, skipping insertion in model container [2023-11-06 22:14:18,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:18" (3/3) ... [2023-11-06 22:14:18,982 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-39.i [2023-11-06 22:14:19,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:14:19,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:14:19,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:19,078 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;@5dd8f479, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:19,079 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:14:19,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.2608695652173914) 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:14:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:14:19,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:19,096 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:19,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:19,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2027876380, now seen corresponding path program 1 times [2023-11-06 22:14:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256552981] [2023-11-06 22:14:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:14:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:14:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:14:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:14:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:14:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:14:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:14:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:14:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:19,607 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:14:19,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:19,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256552981] [2023-11-06 22:14:19,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256552981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:19,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:14:19,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439993730] [2023-11-06 22:14:19,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:19,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:14:19,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:14:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:14:19,649 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) 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) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:14:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:19,677 INFO L93 Difference]: Finished difference Result 69 states and 112 transitions. [2023-11-06 22:14:19,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:14:19,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 76 [2023-11-06 22:14:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:19,687 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:14:19,687 INFO L226 Difference]: Without dead ends: 34 [2023-11-06 22:14:19,691 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:14:19,695 INFO L413 NwaCegarLoop]: 46 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, 46 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:14:19,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:14:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-06 22:14:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-06 22:14:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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:14:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2023-11-06 22:14:19,736 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 76 [2023-11-06 22:14:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:19,737 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2023-11-06 22:14:19,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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:14:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2023-11-06 22:14:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:14:19,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:19,742 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:19,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:14:19,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:19,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:19,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1552619548, now seen corresponding path program 1 times [2023-11-06 22:14:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:19,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141565768] [2023-11-06 22:14:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:14:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:14:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:14:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:14:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:14:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:14:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:14:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:14:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:21,807 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:14:21,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:21,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141565768] [2023-11-06 22:14:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141565768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:14:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414566762] [2023-11-06 22:14:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:21,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:14:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:21,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:14:21,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:14:21,812 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (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:14:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:22,392 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2023-11-06 22:14:22,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:14:22,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2023-11-06 22:14:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:22,395 INFO L225 Difference]: With dead ends: 63 [2023-11-06 22:14:22,395 INFO L226 Difference]: Without dead ends: 61 [2023-11-06 22:14:22,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:14:22,397 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 20 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:22,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 289 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:14:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-06 22:14:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2023-11-06 22:14:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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:14:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-11-06 22:14:22,431 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 76 [2023-11-06 22:14:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:22,433 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-11-06 22:14:22,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (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:14:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2023-11-06 22:14:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-06 22:14:22,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:14:22,443 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:22,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:14:22,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:14:22,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1554466590, now seen corresponding path program 1 times [2023-11-06 22:14:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:22,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455423701] [2023-11-06 22:14:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:22,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:14:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:14:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:14:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:14:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:14:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:14:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:14:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:14:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:14:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:14:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:14:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:14:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:23,688 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:14:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:23,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455423701] [2023-11-06 22:14:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455423701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:23,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:23,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:14:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656864550] [2023-11-06 22:14:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:23,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:14:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:23,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:14:23,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:14:23,691 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (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:14:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:14:24,082 INFO L93 Difference]: Finished difference Result 60 states and 85 transitions. [2023-11-06 22:14:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:14:24,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2023-11-06 22:14:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:14:24,084 INFO L225 Difference]: With dead ends: 60 [2023-11-06 22:14:24,085 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:14:24,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:14:24,087 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 18 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:14:24,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 263 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:14:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:14:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:14:24,089 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:14:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:14:24,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-06 22:14:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:14:24,090 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:14:24,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (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:14:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:14:24,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:14:24,093 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:14:24,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:14:24,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:14:24,248 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2023-11-06 22:14:24,248 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 62) no Hoare annotation was computed. [2023-11-06 22:14:24,248 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-11-06 22:14:24,248 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:14:24,249 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:14:24,249 INFO L902 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: true [2023-11-06 22:14:24,249 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (and (let ((.cse1 (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256))) (.cse0 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse2 (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (.cse3 (= (* (div ~var_1_2~0 256) 256) ~var_1_2~0))) (or (and (= ~var_1_1~0 0) (or (and .cse0 (not .cse1)) .cse2 .cse3)) (and (= ~var_1_1~0 1) (or .cse1 (not .cse0)) (not .cse2) (not .cse3)))) (or (= (+ (* 256 (div (+ ~var_1_9~0 10) 256)) ~var_1_6~0) (+ (* 256 (div ~var_1_6~0 256)) ~var_1_9~0 10)) (< (+ ~var_1_8~0 ~last_1_var_1_6~0) (+ 51 (* 256 (div ~last_1_var_1_6~0 256))))) (not (= |ULTIMATE.start_property_#res#1| 0)) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))) [2023-11-06 22:14:24,250 INFO L902 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: true [2023-11-06 22:14:24,250 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 67 78) the Hoare annotation is: false [2023-11-06 22:14:24,250 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 38) no Hoare annotation was computed. [2023-11-06 22:14:24,250 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:14:24,250 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:14:24,250 INFO L902 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: true [2023-11-06 22:14:24,251 INFO L902 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: true [2023-11-06 22:14:24,251 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:14:24,251 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-11-06 22:14:24,251 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 63 66) the Hoare annotation is: (and (let ((.cse1 (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256))) (.cse0 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse2 (= ~var_1_3~0 (* 256 (div ~var_1_3~0 256)))) (.cse3 (= (* (div ~var_1_2~0 256) 256) ~var_1_2~0))) (or (and (= ~var_1_1~0 0) (or (and .cse0 (not .cse1)) .cse2 .cse3)) (and (= ~var_1_1~0 1) (or .cse1 (not .cse0)) (not .cse2) (not .cse3)))) (or (= (+ (* 256 (div (+ ~var_1_9~0 10) 256)) ~var_1_6~0) (+ (* 256 (div ~var_1_6~0 256)) ~var_1_9~0 10)) (< (+ ~var_1_8~0 ~last_1_var_1_6~0) (+ 51 (* 256 (div ~last_1_var_1_6~0 256))))) (not (= |ULTIMATE.start_property_#res#1| 0))) [2023-11-06 22:14:24,252 INFO L902 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: true [2023-11-06 22:14:24,252 INFO L902 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: true [2023-11-06 22:14:24,252 INFO L902 garLoopResultBuilder]: At program point L70-2(lines 70 76) the Hoare annotation is: true [2023-11-06 22:14:24,252 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 76) no Hoare annotation was computed. [2023-11-06 22:14:24,252 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 39) no Hoare annotation was computed. [2023-11-06 22:14:24,252 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:14:24,253 INFO L899 garLoopResultBuilder]: For program point L58(lines 40 59) no Hoare annotation was computed. [2023-11-06 22:14:24,253 INFO L902 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: true [2023-11-06 22:14:24,253 INFO L902 garLoopResultBuilder]: At program point L54-1(line 54) the Hoare annotation is: true [2023-11-06 22:14:24,253 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-11-06 22:14:24,253 INFO L902 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: true [2023-11-06 22:14:24,253 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:14:24,254 INFO L902 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: true [2023-11-06 22:14:24,254 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-06 22:14:24,254 INFO L902 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: true [2023-11-06 22:14:24,254 INFO L902 garLoopResultBuilder]: At program point L51-1(line 51) the Hoare annotation is: true [2023-11-06 22:14:24,254 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-11-06 22:14:24,254 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:14:24,255 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:14:24,255 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:14:24,255 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:14:24,258 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-06 22:14:24,260 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:14:24,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:14:24 BoogieIcfgContainer [2023-11-06 22:14:24,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:14:24,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:14:24,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:14:24,280 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:14:24,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:18" (3/4) ... [2023-11-06 22:14:24,282 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:14:24,287 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:14:24,292 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-06 22:14:24,292 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:14:24,292 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:14:24,293 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:14:24,322 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_1 == 0) && (((((256 * (var_1_4 / 256)) == var_1_4) && !((var_1_5 == ((var_1_5 / 256) * 256)))) || (var_1_3 == (256 * (var_1_3 / 256)))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((((var_1_1 == 1) && ((var_1_5 == ((var_1_5 / 256) * 256)) || !(((256 * (var_1_4 / 256)) == var_1_4)))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) && ((((256 * ((var_1_9 + 10) / 256)) + var_1_6) == (((256 * (var_1_6 / 256)) + var_1_9) + 10)) || ((var_1_8 + last_1_var_1_6) < (51 + (256 * (last_1_var_1_6 / 256)))))) && !((\result == 0))) [2023-11-06 22:14:24,322 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((var_1_1 == 0) && (((((256 * (var_1_4 / 256)) == var_1_4) && !((var_1_5 == ((var_1_5 / 256) * 256)))) || (var_1_3 == (256 * (var_1_3 / 256)))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((((var_1_1 == 1) && ((var_1_5 == ((var_1_5 / 256) * 256)) || !(((256 * (var_1_4 / 256)) == var_1_4)))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) && ((((256 * ((var_1_9 + 10) / 256)) + var_1_6) == (((256 * (var_1_6 / 256)) + var_1_9) + 10)) || ((var_1_8 + last_1_var_1_6) < (51 + (256 * (last_1_var_1_6 / 256)))))) && !((\result == 0))) && !((cond == 0))) [2023-11-06 22:14:24,341 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_1 == 0) && (((((256 * (var_1_4 / 256)) == var_1_4) && !((var_1_5 == ((var_1_5 / 256) * 256)))) || (var_1_3 == (256 * (var_1_3 / 256)))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((((var_1_1 == 1) && ((var_1_5 == ((var_1_5 / 256) * 256)) || !(((256 * (var_1_4 / 256)) == var_1_4)))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) && ((((256 * ((var_1_9 + 10) / 256)) + var_1_6) == (((256 * (var_1_6 / 256)) + var_1_9) + 10)) || ((var_1_8 + last_1_var_1_6) < (51 + (256 * (last_1_var_1_6 / 256)))))) && !((\result == 0))) [2023-11-06 22:14:24,341 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((var_1_1 == 0) && (((((256 * (var_1_4 / 256)) == var_1_4) && !((var_1_5 == ((var_1_5 / 256) * 256)))) || (var_1_3 == (256 * (var_1_3 / 256)))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((((var_1_1 == 1) && ((var_1_5 == ((var_1_5 / 256) * 256)) || !(((256 * (var_1_4 / 256)) == var_1_4)))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) && ((((256 * ((var_1_9 + 10) / 256)) + var_1_6) == (((256 * (var_1_6 / 256)) + var_1_9) + 10)) || ((var_1_8 + last_1_var_1_6) < (51 + (256 * (last_1_var_1_6 / 256)))))) && !((\result == 0))) && !((cond == 0))) [2023-11-06 22:14:24,347 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:14:24,348 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:14:24,348 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:14:24,349 INFO L158 Benchmark]: Toolchain (without parser) took 6130.57ms. Allocated memory was 184.5MB in the beginning and 224.4MB in the end (delta: 39.8MB). Free memory was 140.4MB in the beginning and 146.4MB in the end (delta: -6.0MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2023-11-06 22:14:24,349 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:14:24,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.68ms. Allocated memory is still 184.5MB. Free memory was 139.9MB in the beginning and 128.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:14:24,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.03ms. Allocated memory is still 184.5MB. Free memory was 128.9MB in the beginning and 126.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:24,350 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 125.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:14:24,350 INFO L158 Benchmark]: RCFGBuilder took 410.22ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 113.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:14:24,351 INFO L158 Benchmark]: TraceAbstraction took 5304.38ms. Allocated memory was 184.5MB in the beginning and 224.4MB in the end (delta: 39.8MB). Free memory was 112.7MB in the beginning and 149.6MB in the end (delta: -36.9MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2023-11-06 22:14:24,351 INFO L158 Benchmark]: Witness Printer took 68.64ms. Allocated memory is still 224.4MB. Free memory was 149.6MB in the beginning and 146.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:14:24,353 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.33ms. Allocated memory is still 134.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.68ms. Allocated memory is still 184.5MB. Free memory was 139.9MB in the beginning and 128.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.03ms. Allocated memory is still 184.5MB. Free memory was 128.9MB in the beginning and 126.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 184.5MB. Free memory was 126.8MB in the beginning and 125.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.22ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 113.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5304.38ms. Allocated memory was 184.5MB in the beginning and 224.4MB in the end (delta: 39.8MB). Free memory was 112.7MB in the beginning and 149.6MB in the end (delta: -36.9MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 68.64ms. Allocated memory is still 224.4MB. Free memory was 149.6MB in the beginning and 146.4MB in the end (delta: 3.1MB). 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 598 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 410 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 188 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 52 PreInvPairs, 80 NumberOfFragments, 233 HoareAnnotationTreeSize, 52 FomulaSimplifications, 116 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 621 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: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: (((((var_1_1 == 0) && (((((256 * (var_1_4 / 256)) == var_1_4) && !((var_1_5 == ((var_1_5 / 256) * 256)))) || (var_1_3 == (256 * (var_1_3 / 256)))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((((var_1_1 == 1) && ((var_1_5 == ((var_1_5 / 256) * 256)) || !(((256 * (var_1_4 / 256)) == var_1_4)))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) && ((((256 * ((var_1_9 + 10) / 256)) + var_1_6) == (((256 * (var_1_6 / 256)) + var_1_9) + 10)) || ((var_1_8 + last_1_var_1_6) < (51 + (256 * (last_1_var_1_6 / 256)))))) && !((\result == 0))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((var_1_1 == 0) && (((((256 * (var_1_4 / 256)) == var_1_4) && !((var_1_5 == ((var_1_5 / 256) * 256)))) || (var_1_3 == (256 * (var_1_3 / 256)))) || (((var_1_2 / 256) * 256) == var_1_2))) || ((((var_1_1 == 1) && ((var_1_5 == ((var_1_5 / 256) * 256)) || !(((256 * (var_1_4 / 256)) == var_1_4)))) && !((var_1_3 == (256 * (var_1_3 / 256))))) && !((((var_1_2 / 256) * 256) == var_1_2)))) && ((((256 * ((var_1_9 + 10) / 256)) + var_1_6) == (((256 * (var_1_6 / 256)) + var_1_9) + 10)) || ((var_1_8 + last_1_var_1_6) < (51 + (256 * (last_1_var_1_6 / 256)))))) && !((\result == 0))) && !((cond == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:14:24,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b6bafcf-438d-42c2-8b78-744146395279/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