./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/interleave_bits.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_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/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_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/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_9149d7a4-6402-49b1-a276-3a5ac3994c29/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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:30:18,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:30:19,032 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:30:19,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:30:19,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:30:19,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:30:19,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:30:19,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:30:19,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:30:19,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:30:19,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:30:19,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:30:19,071 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:30:19,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:30:19,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:30:19,073 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:30:19,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:30:19,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:30:19,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:30:19,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:30:19,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:30:19,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:30:19,078 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:30:19,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:30:19,079 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:30:19,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:30:19,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:30:19,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:30:19,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:30:19,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:30:19,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:30:19,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:30:19,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:30:19,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:30:19,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:30:19,085 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:30:19,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:30:19,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:30:19,086 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:30:19,087 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_9149d7a4-6402-49b1-a276-3a5ac3994c29/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_9149d7a4-6402-49b1-a276-3a5ac3994c29/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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2023-11-06 22:30:19,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:30:19,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:30:19,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:30:19,360 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:30:19,360 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:30:19,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/bitvector/interleave_bits.i [2023-11-06 22:30:22,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:30:22,784 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:30:22,785 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/sv-benchmarks/c/bitvector/interleave_bits.i [2023-11-06 22:30:22,793 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/data/94887bf03/81f10d26490645d59b5621f5ede3d04c/FLAG776c06a80 [2023-11-06 22:30:22,806 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/data/94887bf03/81f10d26490645d59b5621f5ede3d04c [2023-11-06 22:30:22,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:30:22,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:30:22,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:30:22,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:30:22,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:30:22,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:30:22" (1/1) ... [2023-11-06 22:30:22,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3e451d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:22, skipping insertion in model container [2023-11-06 22:30:22,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:30:22" (1/1) ... [2023-11-06 22:30:22,860 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:30:23,005 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_9149d7a4-6402-49b1-a276-3a5ac3994c29/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-11-06 22:30:23,029 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:30:23,040 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:30:23,057 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_9149d7a4-6402-49b1-a276-3a5ac3994c29/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-11-06 22:30:23,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:30:23,086 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:30:23,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23 WrapperNode [2023-11-06 22:30:23,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:30:23,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:30:23,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:30:23,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:30:23,102 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:30:23" (1/1) ... [2023-11-06 22:30:23,123 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:30:23" (1/1) ... [2023-11-06 22:30:23,156 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 217 [2023-11-06 22:30:23,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:30:23,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:30:23,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:30:23,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:30:23,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:30:23,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:30:23,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:30:23,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:30:23,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (1/1) ... [2023-11-06 22:30:23,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:30:23,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:23,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/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:30:23,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/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:30:23,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:30:23,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:30:23,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:30:23,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:30:23,429 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:30:23,432 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:30:26,039 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:30:26,046 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:30:26,047 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:30:26,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:26 BoogieIcfgContainer [2023-11-06 22:30:26,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:30:26,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:30:26,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:30:26,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:30:26,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:30:22" (1/3) ... [2023-11-06 22:30:26,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a17defd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:30:26, skipping insertion in model container [2023-11-06 22:30:26,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:30:23" (2/3) ... [2023-11-06 22:30:26,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a17defd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:30:26, skipping insertion in model container [2023-11-06 22:30:26,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:26" (3/3) ... [2023-11-06 22:30:26,062 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2023-11-06 22:30:26,081 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:30:26,082 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:30:26,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:30:26,144 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;@30c3be41, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:30:26,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:30:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 66 states have internal predecessors, (115), 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:30:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:30:26,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:26,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:26,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1964048980, now seen corresponding path program 1 times [2023-11-06 22:30:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:26,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870351047] [2023-11-06 22:30:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:26,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870351047] [2023-11-06 22:30:26,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870351047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:26,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:26,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:30:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704402005] [2023-11-06 22:30:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:26,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:30:26,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:26,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:30:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:30:26,411 INFO L87 Difference]: Start difference. First operand has 67 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 66 states have internal predecessors, (115), 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) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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:30:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:26,435 INFO L93 Difference]: Finished difference Result 118 states and 200 transitions. [2023-11-06 22:30:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:30:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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) Word has length 32 [2023-11-06 22:30:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:26,447 INFO L225 Difference]: With dead ends: 118 [2023-11-06 22:30:26,448 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 22:30:26,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:30:26,455 INFO L413 NwaCegarLoop]: 113 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, 113 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:30:26,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 22:30:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-06 22:30:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 62 states have internal predecessors, (109), 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:30:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 109 transitions. [2023-11-06 22:30:26,496 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 109 transitions. Word has length 32 [2023-11-06 22:30:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:26,497 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 109 transitions. [2023-11-06 22:30:26,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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:30:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 109 transitions. [2023-11-06 22:30:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:30:26,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:26,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:30:26,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:26,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1504841045, now seen corresponding path program 1 times [2023-11-06 22:30:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301573352] [2023-11-06 22:30:26,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:26,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:26,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301573352] [2023-11-06 22:30:26,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301573352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:26,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:26,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:30:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816433590] [2023-11-06 22:30:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:26,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:30:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:26,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:30:26,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:26,776 INFO L87 Difference]: Start difference. First operand 63 states and 109 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:30:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:26,829 INFO L93 Difference]: Finished difference Result 138 states and 243 transitions. [2023-11-06 22:30:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:30:26,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) Word has length 32 [2023-11-06 22:30:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:26,832 INFO L225 Difference]: With dead ends: 138 [2023-11-06 22:30:26,832 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 22:30:26,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:26,834 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:26,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 199 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 22:30:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2023-11-06 22:30:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 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:30:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 117 transitions. [2023-11-06 22:30:26,845 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 117 transitions. Word has length 32 [2023-11-06 22:30:26,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:26,846 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 117 transitions. [2023-11-06 22:30:26,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:30:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 117 transitions. [2023-11-06 22:30:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:30:26,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:26,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:30:26,849 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:26,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:26,850 INFO L85 PathProgramCache]: Analyzing trace with hash 764891864, now seen corresponding path program 1 times [2023-11-06 22:30:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:26,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360558854] [2023-11-06 22:30:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:27,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:27,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360558854] [2023-11-06 22:30:27,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360558854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:27,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032885631] [2023-11-06 22:30:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:27,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:27,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:27,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:27,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:30:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:27,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:30:27,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:27,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:27,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032885631] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:27,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:27,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-06 22:30:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382572183] [2023-11-06 22:30:27,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:27,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:30:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:27,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:30:27,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:30:27,334 INFO L87 Difference]: Start difference. First operand 69 states and 117 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:30:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:27,512 INFO L93 Difference]: Finished difference Result 167 states and 295 transitions. [2023-11-06 22:30:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) Word has length 42 [2023-11-06 22:30:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:27,524 INFO L225 Difference]: With dead ends: 167 [2023-11-06 22:30:27,524 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:30:27,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:30:27,530 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 148 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:27,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 422 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:30:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-06 22:30:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.7428571428571429) internal successors, (183), 105 states have internal predecessors, (183), 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:30:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 183 transitions. [2023-11-06 22:30:27,567 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 183 transitions. Word has length 42 [2023-11-06 22:30:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:27,568 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 183 transitions. [2023-11-06 22:30:27,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:30:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 183 transitions. [2023-11-06 22:30:27,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:30:27,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:27,571 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:27,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:30:27,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:27,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:27,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1185084183, now seen corresponding path program 1 times [2023-11-06 22:30:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972872033] [2023-11-06 22:30:27,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:30:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972872033] [2023-11-06 22:30:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972872033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:30:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465589665] [2023-11-06 22:30:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:27,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:30:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:27,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:30:27,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:27,941 INFO L87 Difference]: Start difference. First operand 106 states and 183 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:30:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:27,987 INFO L93 Difference]: Finished difference Result 192 states and 337 transitions. [2023-11-06 22:30:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:30:27,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) Word has length 72 [2023-11-06 22:30:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:27,991 INFO L225 Difference]: With dead ends: 192 [2023-11-06 22:30:27,991 INFO L226 Difference]: Without dead ends: 118 [2023-11-06 22:30:27,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:28,000 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 99 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:28,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 140 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:28,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-06 22:30:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2023-11-06 22:30:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.7339449541284404) internal successors, (189), 109 states have internal predecessors, (189), 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:30:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 189 transitions. [2023-11-06 22:30:28,014 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 189 transitions. Word has length 72 [2023-11-06 22:30:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:28,014 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 189 transitions. [2023-11-06 22:30:28,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:30:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2023-11-06 22:30:28,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:30:28,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:28,018 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:28,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:30:28,019 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:28,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:28,019 INFO L85 PathProgramCache]: Analyzing trace with hash 743188519, now seen corresponding path program 2 times [2023-11-06 22:30:28,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:28,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371489686] [2023-11-06 22:30:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-06 22:30:28,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:28,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371489686] [2023-11-06 22:30:28,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371489686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:28,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:28,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:30:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152529816] [2023-11-06 22:30:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:28,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:30:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:28,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:30:28,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:28,274 INFO L87 Difference]: Start difference. First operand 110 states and 189 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:30:28,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:28,298 INFO L93 Difference]: Finished difference Result 241 states and 420 transitions. [2023-11-06 22:30:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:30:28,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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) Word has length 72 [2023-11-06 22:30:28,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:28,301 INFO L225 Difference]: With dead ends: 241 [2023-11-06 22:30:28,301 INFO L226 Difference]: Without dead ends: 152 [2023-11-06 22:30:28,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:30:28,306 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 17 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:28,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-06 22:30:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 114. [2023-11-06 22:30:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.7079646017699115) internal successors, (193), 113 states have internal predecessors, (193), 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:30:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 193 transitions. [2023-11-06 22:30:28,321 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 193 transitions. Word has length 72 [2023-11-06 22:30:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:28,322 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 193 transitions. [2023-11-06 22:30:28,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:30:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 193 transitions. [2023-11-06 22:30:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-06 22:30:28,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:28,334 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:28,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:30:28,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:28,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash -824171871, now seen corresponding path program 1 times [2023-11-06 22:30:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471747870] [2023-11-06 22:30:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:28,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:28,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471747870] [2023-11-06 22:30:28,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471747870] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674111364] [2023-11-06 22:30:28,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:28,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:28,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:28,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:28,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:30:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:28,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:30:28,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:28,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674111364] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:29,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:29,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-06 22:30:29,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831682591] [2023-11-06 22:30:29,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:29,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:30:29,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:30:29,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:30:29,206 INFO L87 Difference]: Start difference. First operand 114 states and 193 transitions. Second operand has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 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:30:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:29,855 INFO L93 Difference]: Finished difference Result 291 states and 505 transitions. [2023-11-06 22:30:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:30:29,856 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 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) Word has length 72 [2023-11-06 22:30:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:29,859 INFO L225 Difference]: With dead ends: 291 [2023-11-06 22:30:29,860 INFO L226 Difference]: Without dead ends: 214 [2023-11-06 22:30:29,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:30:29,861 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 568 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:29,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 968 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:30:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-11-06 22:30:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 204. [2023-11-06 22:30:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.7044334975369457) internal successors, (346), 203 states have internal predecessors, (346), 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:30:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 346 transitions. [2023-11-06 22:30:29,880 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 346 transitions. Word has length 72 [2023-11-06 22:30:29,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:29,880 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 346 transitions. [2023-11-06 22:30:29,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.923076923076923) internal successors, (116), 13 states have internal predecessors, (116), 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:30:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 346 transitions. [2023-11-06 22:30:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:30:29,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:29,891 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:29,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:30,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:30,099 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:30,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1866809587, now seen corresponding path program 2 times [2023-11-06 22:30:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:30,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164000433] [2023-11-06 22:30:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:31,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:31,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164000433] [2023-11-06 22:30:31,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164000433] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:31,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104827735] [2023-11-06 22:30:31,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:30:31,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:31,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:31,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:30:31,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:30:31,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:30:31,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:30:31,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:31,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:30:31,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104827735] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:31,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:31,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-06 22:30:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788993172] [2023-11-06 22:30:31,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:31,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:30:31,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:31,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:30:31,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:30:31,919 INFO L87 Difference]: Start difference. First operand 204 states and 346 transitions. Second operand has 25 states, 25 states have (on average 9.44) internal successors, (236), 25 states have internal predecessors, (236), 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:30:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:38,239 INFO L93 Difference]: Finished difference Result 500 states and 866 transitions. [2023-11-06 22:30:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:30:38,240 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.44) internal successors, (236), 25 states have internal predecessors, (236), 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) Word has length 132 [2023-11-06 22:30:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:38,243 INFO L225 Difference]: With dead ends: 500 [2023-11-06 22:30:38,243 INFO L226 Difference]: Without dead ends: 378 [2023-11-06 22:30:38,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:30:38,245 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 1211 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:38,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 2750 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:30:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-11-06 22:30:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 365. [2023-11-06 22:30:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.7005494505494505) internal successors, (619), 364 states have internal predecessors, (619), 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:30:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 619 transitions. [2023-11-06 22:30:38,261 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 619 transitions. Word has length 132 [2023-11-06 22:30:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:38,262 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 619 transitions. [2023-11-06 22:30:38,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.44) internal successors, (236), 25 states have internal predecessors, (236), 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:30:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 619 transitions. [2023-11-06 22:30:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:30:38,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:38,267 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:38,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:38,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:38,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:38,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash -458831803, now seen corresponding path program 3 times [2023-11-06 22:30:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:38,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818056622] [2023-11-06 22:30:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2023-11-06 22:30:40,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818056622] [2023-11-06 22:30:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818056622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:40,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:30:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121059208] [2023-11-06 22:30:40,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:40,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:30:40,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:40,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:30:40,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:40,295 INFO L87 Difference]: Start difference. First operand 365 states and 619 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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:30:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:40,663 INFO L93 Difference]: Finished difference Result 1403 states and 2376 transitions. [2023-11-06 22:30:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:30:40,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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) Word has length 192 [2023-11-06 22:30:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:40,670 INFO L225 Difference]: With dead ends: 1403 [2023-11-06 22:30:40,670 INFO L226 Difference]: Without dead ends: 1047 [2023-11-06 22:30:40,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:30:40,672 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 133 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:40,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 921 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2023-11-06 22:30:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 873. [2023-11-06 22:30:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.5928899082568808) internal successors, (1389), 872 states have internal predecessors, (1389), 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:30:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1389 transitions. [2023-11-06 22:30:40,717 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1389 transitions. Word has length 192 [2023-11-06 22:30:40,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:40,718 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 1389 transitions. [2023-11-06 22:30:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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:30:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1389 transitions. [2023-11-06 22:30:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-06 22:30:40,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:40,723 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:40,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:30:40,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:40,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1337158787, now seen corresponding path program 1 times [2023-11-06 22:30:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664645414] [2023-11-06 22:30:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:41,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:41,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664645414] [2023-11-06 22:30:41,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664645414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:41,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:41,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:30:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406112157] [2023-11-06 22:30:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:41,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:30:41,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:41,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:30:41,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:30:41,487 INFO L87 Difference]: Start difference. First operand 873 states and 1389 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:30:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:41,674 INFO L93 Difference]: Finished difference Result 926 states and 1473 transitions. [2023-11-06 22:30:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:30:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) Word has length 193 [2023-11-06 22:30:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:41,681 INFO L225 Difference]: With dead ends: 926 [2023-11-06 22:30:41,681 INFO L226 Difference]: Without dead ends: 918 [2023-11-06 22:30:41,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:30:41,682 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 28 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:41,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 293 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:30:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2023-11-06 22:30:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 914. [2023-11-06 22:30:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 913 states have (on average 1.5991237677984667) internal successors, (1460), 913 states have internal predecessors, (1460), 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:30:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1460 transitions. [2023-11-06 22:30:41,717 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1460 transitions. Word has length 193 [2023-11-06 22:30:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:41,717 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 1460 transitions. [2023-11-06 22:30:41,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:30:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1460 transitions. [2023-11-06 22:30:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-06 22:30:41,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:41,722 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:41,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:30:41,722 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:41,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash 318565411, now seen corresponding path program 1 times [2023-11-06 22:30:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542906930] [2023-11-06 22:30:41,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:42,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542906930] [2023-11-06 22:30:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542906930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:42,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:42,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:30:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430872591] [2023-11-06 22:30:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:42,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:42,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:42,534 INFO L87 Difference]: Start difference. First operand 914 states and 1460 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:30:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:43,240 INFO L93 Difference]: Finished difference Result 958 states and 1524 transitions. [2023-11-06 22:30:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:43,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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) Word has length 193 [2023-11-06 22:30:43,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:43,246 INFO L225 Difference]: With dead ends: 958 [2023-11-06 22:30:43,246 INFO L226 Difference]: Without dead ends: 932 [2023-11-06 22:30:43,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:30:43,248 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:43,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:30:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2023-11-06 22:30:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 923. [2023-11-06 22:30:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.5911062906724511) internal successors, (1467), 922 states have internal predecessors, (1467), 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:30:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1467 transitions. [2023-11-06 22:30:43,317 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1467 transitions. Word has length 193 [2023-11-06 22:30:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:43,317 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1467 transitions. [2023-11-06 22:30:43,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:30:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1467 transitions. [2023-11-06 22:30:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-06 22:30:43,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:43,322 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:43,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:30:43,323 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:43,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash 426319216, now seen corresponding path program 1 times [2023-11-06 22:30:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676288569] [2023-11-06 22:30:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2023-11-06 22:30:43,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:43,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676288569] [2023-11-06 22:30:43,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676288569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:43,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:43,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:30:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116184360] [2023-11-06 22:30:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:43,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:30:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:30:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:30:43,981 INFO L87 Difference]: Start difference. First operand 923 states and 1467 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:30:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:44,036 INFO L93 Difference]: Finished difference Result 2268 states and 3608 transitions. [2023-11-06 22:30:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:30:44,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) Word has length 193 [2023-11-06 22:30:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:44,046 INFO L225 Difference]: With dead ends: 2268 [2023-11-06 22:30:44,046 INFO L226 Difference]: Without dead ends: 1375 [2023-11-06 22:30:44,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:44,048 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 24 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:44,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 310 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2023-11-06 22:30:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1211. [2023-11-06 22:30:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1210 states have (on average 1.5537190082644627) internal successors, (1880), 1210 states have internal predecessors, (1880), 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:30:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1880 transitions. [2023-11-06 22:30:44,094 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1880 transitions. Word has length 193 [2023-11-06 22:30:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:44,095 INFO L495 AbstractCegarLoop]: Abstraction has 1211 states and 1880 transitions. [2023-11-06 22:30:44,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:30:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1880 transitions. [2023-11-06 22:30:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-11-06 22:30:44,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:44,101 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:44,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:30:44,101 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:44,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:44,102 INFO L85 PathProgramCache]: Analyzing trace with hash 983450283, now seen corresponding path program 1 times [2023-11-06 22:30:44,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:44,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241137710] [2023-11-06 22:30:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 287 proven. 14 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2023-11-06 22:30:44,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241137710] [2023-11-06 22:30:44,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241137710] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:44,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28242063] [2023-11-06 22:30:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:44,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:44,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:44,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:44,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:30:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:44,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:30:44,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 287 proven. 14 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2023-11-06 22:30:45,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 287 proven. 14 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2023-11-06 22:30:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28242063] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:45,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 22:30:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959341186] [2023-11-06 22:30:45,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:45,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:45,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:45,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:45,438 INFO L87 Difference]: Start difference. First operand 1211 states and 1880 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:30:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:45,525 INFO L93 Difference]: Finished difference Result 2577 states and 3986 transitions. [2023-11-06 22:30:45,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:30:45,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) Word has length 193 [2023-11-06 22:30:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:45,534 INFO L225 Difference]: With dead ends: 2577 [2023-11-06 22:30:45,535 INFO L226 Difference]: Without dead ends: 1444 [2023-11-06 22:30:45,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 384 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:30:45,537 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 139 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:45,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 436 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-11-06 22:30:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1335. [2023-11-06 22:30:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1334 states have (on average 1.4670164917541229) internal successors, (1957), 1334 states have internal predecessors, (1957), 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:30:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1957 transitions. [2023-11-06 22:30:45,624 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1957 transitions. Word has length 193 [2023-11-06 22:30:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:45,625 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 1957 transitions. [2023-11-06 22:30:45,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:30:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1957 transitions. [2023-11-06 22:30:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-06 22:30:45,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:45,631 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:45,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:45,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:45,841 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:45,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash -297559137, now seen corresponding path program 1 times [2023-11-06 22:30:45,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:45,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151146337] [2023-11-06 22:30:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:46,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151146337] [2023-11-06 22:30:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151146337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:46,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:46,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:30:46,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705216876] [2023-11-06 22:30:46,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:46,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:46,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:46,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:46,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:46,935 INFO L87 Difference]: Start difference. First operand 1335 states and 1957 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:30:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:47,042 INFO L93 Difference]: Finished difference Result 1452 states and 2146 transitions. [2023-11-06 22:30:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:47,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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) Word has length 194 [2023-11-06 22:30:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:47,050 INFO L225 Difference]: With dead ends: 1452 [2023-11-06 22:30:47,050 INFO L226 Difference]: Without dead ends: 1347 [2023-11-06 22:30:47,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:30:47,052 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:47,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:47,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2023-11-06 22:30:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1341. [2023-11-06 22:30:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1340 states have (on average 1.4649253731343284) internal successors, (1963), 1340 states have internal predecessors, (1963), 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:30:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1963 transitions. [2023-11-06 22:30:47,115 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1963 transitions. Word has length 194 [2023-11-06 22:30:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:47,115 INFO L495 AbstractCegarLoop]: Abstraction has 1341 states and 1963 transitions. [2023-11-06 22:30:47,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:30:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1963 transitions. [2023-11-06 22:30:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-06 22:30:47,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:47,120 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:47,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:30:47,121 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:47,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2004634471, now seen corresponding path program 1 times [2023-11-06 22:30:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:47,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46214171] [2023-11-06 22:30:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:47,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 290 proven. 14 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2023-11-06 22:30:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:47,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46214171] [2023-11-06 22:30:47,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46214171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:47,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653540693] [2023-11-06 22:30:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:47,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:47,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:47,461 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:47,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:30:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:47,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:30:47,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 290 proven. 14 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2023-11-06 22:30:47,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:30:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 290 proven. 14 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2023-11-06 22:30:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653540693] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:30:48,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:30:48,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 22:30:48,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53939967] [2023-11-06 22:30:48,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:30:48,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:48,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:48,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:48,354 INFO L87 Difference]: Start difference. First operand 1341 states and 1963 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:30:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:48,489 INFO L93 Difference]: Finished difference Result 3112 states and 4581 transitions. [2023-11-06 22:30:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:30:48,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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) Word has length 194 [2023-11-06 22:30:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:48,500 INFO L225 Difference]: With dead ends: 3112 [2023-11-06 22:30:48,500 INFO L226 Difference]: Without dead ends: 1830 [2023-11-06 22:30:48,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 386 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:30:48,505 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 173 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:48,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 336 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:30:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2023-11-06 22:30:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1685. [2023-11-06 22:30:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1685 states, 1684 states have (on average 1.4251781472684086) internal successors, (2400), 1684 states have internal predecessors, (2400), 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:30:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2400 transitions. [2023-11-06 22:30:48,595 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2400 transitions. Word has length 194 [2023-11-06 22:30:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:48,595 INFO L495 AbstractCegarLoop]: Abstraction has 1685 states and 2400 transitions. [2023-11-06 22:30:48,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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:30:48,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2400 transitions. [2023-11-06 22:30:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-11-06 22:30:48,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:48,602 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:48,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:48,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:48,809 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:48,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash -774053859, now seen corresponding path program 1 times [2023-11-06 22:30:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722086950] [2023-11-06 22:30:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:49,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722086950] [2023-11-06 22:30:49,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722086950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:49,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:49,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:30:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979415533] [2023-11-06 22:30:49,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:49,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:49,502 INFO L87 Difference]: Start difference. First operand 1685 states and 2400 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:30:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:49,654 INFO L93 Difference]: Finished difference Result 1758 states and 2507 transitions. [2023-11-06 22:30:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:49,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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) Word has length 195 [2023-11-06 22:30:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:49,664 INFO L225 Difference]: With dead ends: 1758 [2023-11-06 22:30:49,665 INFO L226 Difference]: Without dead ends: 1703 [2023-11-06 22:30:49,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:30:49,666 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:49,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 391 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2023-11-06 22:30:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1694. [2023-11-06 22:30:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1693 states have (on average 1.4217365623154163) internal successors, (2407), 1693 states have internal predecessors, (2407), 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:30:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2407 transitions. [2023-11-06 22:30:49,751 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2407 transitions. Word has length 195 [2023-11-06 22:30:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:49,752 INFO L495 AbstractCegarLoop]: Abstraction has 1694 states and 2407 transitions. [2023-11-06 22:30:49,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:30:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2407 transitions. [2023-11-06 22:30:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-11-06 22:30:49,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:49,758 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:49,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:30:49,759 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:49,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1402734053, now seen corresponding path program 1 times [2023-11-06 22:30:49,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872170125] [2023-11-06 22:30:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:50,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872170125] [2023-11-06 22:30:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872170125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:50,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:50,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:30:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896295912] [2023-11-06 22:30:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:50,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:50,544 INFO L87 Difference]: Start difference. First operand 1694 states and 2407 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:30:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:50,706 INFO L93 Difference]: Finished difference Result 1836 states and 2627 transitions. [2023-11-06 22:30:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:50,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) Word has length 196 [2023-11-06 22:30:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:50,717 INFO L225 Difference]: With dead ends: 1836 [2023-11-06 22:30:50,717 INFO L226 Difference]: Without dead ends: 1706 [2023-11-06 22:30:50,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:30:50,719 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:50,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2023-11-06 22:30:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1700. [2023-11-06 22:30:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1699 states have (on average 1.420247204237787) internal successors, (2413), 1699 states have internal predecessors, (2413), 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:30:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2413 transitions. [2023-11-06 22:30:50,826 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2413 transitions. Word has length 196 [2023-11-06 22:30:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:50,827 INFO L495 AbstractCegarLoop]: Abstraction has 1700 states and 2413 transitions. [2023-11-06 22:30:50,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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:30:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2413 transitions. [2023-11-06 22:30:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-11-06 22:30:50,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:50,835 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:30:50,835 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:50,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2126204483, now seen corresponding path program 1 times [2023-11-06 22:30:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:50,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137042013] [2023-11-06 22:30:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:51,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137042013] [2023-11-06 22:30:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137042013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:51,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:30:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717514134] [2023-11-06 22:30:51,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:51,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:51,510 INFO L87 Difference]: Start difference. First operand 1700 states and 2413 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:30:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:52,183 INFO L93 Difference]: Finished difference Result 1802 states and 2563 transitions. [2023-11-06 22:30:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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) Word has length 197 [2023-11-06 22:30:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:52,193 INFO L225 Difference]: With dead ends: 1802 [2023-11-06 22:30:52,193 INFO L226 Difference]: Without dead ends: 1718 [2023-11-06 22:30:52,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:30:52,195 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:52,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 391 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:30:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2023-11-06 22:30:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1709. [2023-11-06 22:30:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 1.4168618266978923) internal successors, (2420), 1708 states have internal predecessors, (2420), 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:30:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2420 transitions. [2023-11-06 22:30:52,281 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2420 transitions. Word has length 197 [2023-11-06 22:30:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:52,282 INFO L495 AbstractCegarLoop]: Abstraction has 1709 states and 2420 transitions. [2023-11-06 22:30:52,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:30:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2420 transitions. [2023-11-06 22:30:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-11-06 22:30:52,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:52,288 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:52,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:30:52,289 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:52,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash 289711745, now seen corresponding path program 1 times [2023-11-06 22:30:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:52,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816303080] [2023-11-06 22:30:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:53,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:53,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816303080] [2023-11-06 22:30:53,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816303080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:53,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:30:53,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:30:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437286287] [2023-11-06 22:30:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:53,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:53,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:53,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:53,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:30:53,044 INFO L87 Difference]: Start difference. First operand 1709 states and 2420 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:30:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:53,725 INFO L93 Difference]: Finished difference Result 1876 states and 2671 transitions. [2023-11-06 22:30:53,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:53,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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) Word has length 198 [2023-11-06 22:30:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:53,735 INFO L225 Difference]: With dead ends: 1876 [2023-11-06 22:30:53,735 INFO L226 Difference]: Without dead ends: 1721 [2023-11-06 22:30:53,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:30:53,737 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:53,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:30:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2023-11-06 22:30:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1715. [2023-11-06 22:30:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 1.4154025670945158) internal successors, (2426), 1714 states have internal predecessors, (2426), 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:30:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2426 transitions. [2023-11-06 22:30:53,819 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2426 transitions. Word has length 198 [2023-11-06 22:30:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:53,819 INFO L495 AbstractCegarLoop]: Abstraction has 1715 states and 2426 transitions. [2023-11-06 22:30:53,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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:30:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2426 transitions. [2023-11-06 22:30:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-06 22:30:53,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:53,825 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:53,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:30:53,826 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:53,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:53,826 INFO L85 PathProgramCache]: Analyzing trace with hash -756381189, now seen corresponding path program 1 times [2023-11-06 22:30:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:53,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098610732] [2023-11-06 22:30:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 217 proven. 14 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2023-11-06 22:30:54,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:54,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098610732] [2023-11-06 22:30:54,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098610732] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:54,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821926932] [2023-11-06 22:30:54,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:54,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:54,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:54,719 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:54,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:30:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:54,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:30:54,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:54,968 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:30:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821926932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:54,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:30:54,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-11-06 22:30:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139395704] [2023-11-06 22:30:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:54,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:54,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:54,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:30:54,971 INFO L87 Difference]: Start difference. First operand 1715 states and 2426 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:30:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:56,407 INFO L93 Difference]: Finished difference Result 1766 states and 2497 transitions. [2023-11-06 22:30:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:56,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) Word has length 199 [2023-11-06 22:30:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:56,417 INFO L225 Difference]: With dead ends: 1766 [2023-11-06 22:30:56,417 INFO L226 Difference]: Without dead ends: 1733 [2023-11-06 22:30:56,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:56,418 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 58 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:56,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 326 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:30:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2023-11-06 22:30:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1723. [2023-11-06 22:30:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1722 states have (on average 1.4152148664343787) internal successors, (2437), 1722 states have internal predecessors, (2437), 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:30:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2437 transitions. [2023-11-06 22:30:56,504 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2437 transitions. Word has length 199 [2023-11-06 22:30:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:56,505 INFO L495 AbstractCegarLoop]: Abstraction has 1723 states and 2437 transitions. [2023-11-06 22:30:56,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:30:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2437 transitions. [2023-11-06 22:30:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-06 22:30:56,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:56,511 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:56,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:30:56,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:56,718 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:56,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash -55316611, now seen corresponding path program 1 times [2023-11-06 22:30:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:56,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483097056] [2023-11-06 22:30:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 217 proven. 14 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2023-11-06 22:30:57,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:57,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483097056] [2023-11-06 22:30:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483097056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:57,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534102705] [2023-11-06 22:30:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:57,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:57,590 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:57,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:30:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:57,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:30:57,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:30:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:30:57,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:30:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534102705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:30:57,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:30:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-11-06 22:30:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831968908] [2023-11-06 22:30:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:30:57,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:30:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:30:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:30:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:30:57,835 INFO L87 Difference]: Start difference. First operand 1723 states and 2437 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:30:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:30:58,295 INFO L93 Difference]: Finished difference Result 1746 states and 2466 transitions. [2023-11-06 22:30:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:30:58,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) Word has length 199 [2023-11-06 22:30:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:30:58,305 INFO L225 Difference]: With dead ends: 1746 [2023-11-06 22:30:58,305 INFO L226 Difference]: Without dead ends: 1737 [2023-11-06 22:30:58,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:30:58,307 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 58 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:30:58,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 326 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:30:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2023-11-06 22:30:58,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1729. [2023-11-06 22:30:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1728 states have (on average 1.4155092592592593) internal successors, (2446), 1728 states have internal predecessors, (2446), 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:30:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2446 transitions. [2023-11-06 22:30:58,392 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2446 transitions. Word has length 199 [2023-11-06 22:30:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:30:58,392 INFO L495 AbstractCegarLoop]: Abstraction has 1729 states and 2446 transitions. [2023-11-06 22:30:58,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:30:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2446 transitions. [2023-11-06 22:30:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-11-06 22:30:58,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:30:58,399 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:58,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-06 22:30:58,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:58,605 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:30:58,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:30:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1941691, now seen corresponding path program 1 times [2023-11-06 22:30:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:30:58,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165017163] [2023-11-06 22:30:58,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:30:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 217 proven. 14 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2023-11-06 22:30:59,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:30:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165017163] [2023-11-06 22:30:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165017163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:30:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909282591] [2023-11-06 22:30:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:30:59,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:30:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:30:59,515 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:30:59,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:30:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:30:59,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:30:59,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 188 proven. 45 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2023-11-06 22:31:00,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 217 proven. 14 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2023-11-06 22:31:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909282591] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:00,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:31:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2023-11-06 22:31:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725427907] [2023-11-06 22:31:00,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:00,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:31:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:00,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:31:00,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:31:00,925 INFO L87 Difference]: Start difference. First operand 1729 states and 2446 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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:31:03,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:31:05,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:31:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:06,580 INFO L93 Difference]: Finished difference Result 1962 states and 2762 transitions. [2023-11-06 22:31:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:31:06,580 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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) Word has length 199 [2023-11-06 22:31:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:06,590 INFO L225 Difference]: With dead ends: 1962 [2023-11-06 22:31:06,590 INFO L226 Difference]: Without dead ends: 1827 [2023-11-06 22:31:06,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 390 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:31:06,592 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 247 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:06,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1016 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 237 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2023-11-06 22:31:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2023-11-06 22:31:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1714. [2023-11-06 22:31:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.4098073555166375) internal successors, (2415), 1713 states have internal predecessors, (2415), 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:31:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2415 transitions. [2023-11-06 22:31:06,678 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2415 transitions. Word has length 199 [2023-11-06 22:31:06,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:06,679 INFO L495 AbstractCegarLoop]: Abstraction has 1714 states and 2415 transitions. [2023-11-06 22:31:06,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 states have internal predecessors, (88), 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:31:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2415 transitions. [2023-11-06 22:31:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-06 22:31:06,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:06,685 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:06,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:06,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 22:31:06,893 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:06,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -195609273, now seen corresponding path program 1 times [2023-11-06 22:31:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037973497] [2023-11-06 22:31:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:06,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 178 proven. 14 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2023-11-06 22:31:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037973497] [2023-11-06 22:31:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037973497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:07,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620138720] [2023-11-06 22:31:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:07,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:07,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:07,668 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:07,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:31:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:07,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:31:07,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:31:07,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:31:07,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620138720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:07,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:31:07,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-11-06 22:31:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211316446] [2023-11-06 22:31:07,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:07,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:07,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:07,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:07,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:31:07,918 INFO L87 Difference]: Start difference. First operand 1714 states and 2415 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:31:09,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:31:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:10,407 INFO L93 Difference]: Finished difference Result 1785 states and 2510 transitions. [2023-11-06 22:31:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:31:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) Word has length 200 [2023-11-06 22:31:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:10,417 INFO L225 Difference]: With dead ends: 1785 [2023-11-06 22:31:10,417 INFO L226 Difference]: Without dead ends: 1727 [2023-11-06 22:31:10,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:31:10,419 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 22 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:10,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 362 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2023-11-06 22:31:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2023-11-06 22:31:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1720. [2023-11-06 22:31:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 1.409540430482839) internal successors, (2423), 1719 states have internal predecessors, (2423), 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:31:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2423 transitions. [2023-11-06 22:31:10,494 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2423 transitions. Word has length 200 [2023-11-06 22:31:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:10,495 INFO L495 AbstractCegarLoop]: Abstraction has 1720 states and 2423 transitions. [2023-11-06 22:31:10,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:31:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2423 transitions. [2023-11-06 22:31:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-06 22:31:10,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:10,501 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:10,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:31:10,714 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:10,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:10,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1884553015, now seen corresponding path program 1 times [2023-11-06 22:31:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:10,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262741274] [2023-11-06 22:31:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 178 proven. 14 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2023-11-06 22:31:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262741274] [2023-11-06 22:31:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262741274] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:11,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220554047] [2023-11-06 22:31:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:11,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:11,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:11,462 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:11,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:31:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:11,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:31:11,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1216 trivial. 0 not checked. [2023-11-06 22:31:11,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:31:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220554047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:11,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:31:11,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-11-06 22:31:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552137687] [2023-11-06 22:31:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:11,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:31:11,717 INFO L87 Difference]: Start difference. First operand 1720 states and 2423 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:31:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:12,732 INFO L93 Difference]: Finished difference Result 1852 states and 2609 transitions. [2023-11-06 22:31:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:31:12,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) Word has length 200 [2023-11-06 22:31:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:12,747 INFO L225 Difference]: With dead ends: 1852 [2023-11-06 22:31:12,747 INFO L226 Difference]: Without dead ends: 1733 [2023-11-06 22:31:12,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:31:12,749 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 22 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:12,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 362 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:31:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2023-11-06 22:31:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1726. [2023-11-06 22:31:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 1.4092753623188405) internal successors, (2431), 1725 states have internal predecessors, (2431), 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:31:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2431 transitions. [2023-11-06 22:31:12,840 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2431 transitions. Word has length 200 [2023-11-06 22:31:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:12,840 INFO L495 AbstractCegarLoop]: Abstraction has 1726 states and 2431 transitions. [2023-11-06 22:31:12,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:31:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2431 transitions. [2023-11-06 22:31:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-06 22:31:12,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:12,847 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:12,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:13,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 22:31:13,055 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:13,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2018566521, now seen corresponding path program 1 times [2023-11-06 22:31:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694526402] [2023-11-06 22:31:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 178 proven. 14 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2023-11-06 22:31:13,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694526402] [2023-11-06 22:31:13,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694526402] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531597530] [2023-11-06 22:31:13,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:13,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:13,807 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:13,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:31:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:13,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:31:14,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 149 proven. 45 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2023-11-06 22:31:14,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 178 proven. 14 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2023-11-06 22:31:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531597530] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:14,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:31:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2023-11-06 22:31:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193245308] [2023-11-06 22:31:14,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:14,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:31:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:31:14,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:31:14,885 INFO L87 Difference]: Start difference. First operand 1726 states and 2431 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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:31:18,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:31:20,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:31:22,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:31:24,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-06 22:31:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:25,939 INFO L93 Difference]: Finished difference Result 2020 states and 2838 transitions. [2023-11-06 22:31:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:31:25,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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) Word has length 200 [2023-11-06 22:31:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:25,946 INFO L225 Difference]: With dead ends: 2020 [2023-11-06 22:31:25,946 INFO L226 Difference]: Without dead ends: 1631 [2023-11-06 22:31:25,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 394 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:31:25,949 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 276 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 31 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:25,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 714 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 10.8s Time] [2023-11-06 22:31:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2023-11-06 22:31:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1527. [2023-11-06 22:31:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1526 states have (on average 1.4272608125819135) internal successors, (2178), 1526 states have internal predecessors, (2178), 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:31:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2178 transitions. [2023-11-06 22:31:26,001 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2178 transitions. Word has length 200 [2023-11-06 22:31:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:26,002 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 2178 transitions. [2023-11-06 22:31:26,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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:31:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2178 transitions. [2023-11-06 22:31:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-11-06 22:31:26,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:26,007 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:26,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-06 22:31:26,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 22:31:26,214 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:26,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1606497471, now seen corresponding path program 1 times [2023-11-06 22:31:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174047066] [2023-11-06 22:31:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2023-11-06 22:31:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174047066] [2023-11-06 22:31:26,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174047066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:26,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074990777] [2023-11-06 22:31:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:26,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:26,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:26,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:26,395 INFO L87 Difference]: Start difference. First operand 1527 states and 2178 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:31:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:26,481 INFO L93 Difference]: Finished difference Result 2497 states and 3439 transitions. [2023-11-06 22:31:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:26,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) Word has length 208 [2023-11-06 22:31:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:26,489 INFO L225 Difference]: With dead ends: 2497 [2023-11-06 22:31:26,495 INFO L226 Difference]: Without dead ends: 1571 [2023-11-06 22:31:26,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:26,501 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 112 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:26,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 328 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2023-11-06 22:31:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1527. [2023-11-06 22:31:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1526 states have (on average 1.401048492791612) internal successors, (2138), 1526 states have internal predecessors, (2138), 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:31:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2138 transitions. [2023-11-06 22:31:26,558 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2138 transitions. Word has length 208 [2023-11-06 22:31:26,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:26,558 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 2138 transitions. [2023-11-06 22:31:26,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:31:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2138 transitions. [2023-11-06 22:31:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-11-06 22:31:26,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:26,564 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:26,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:31:26,565 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:26,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash -83910891, now seen corresponding path program 1 times [2023-11-06 22:31:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:26,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181410212] [2023-11-06 22:31:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:26,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2023-11-06 22:31:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181410212] [2023-11-06 22:31:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181410212] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:26,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86199548] [2023-11-06 22:31:26,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:26,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:26,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:26,989 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:27,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 22:31:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:27,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:31:27,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 271 proven. 8 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2023-11-06 22:31:27,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:27,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 340 proven. 8 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2023-11-06 22:31:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86199548] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:27,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:31:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 16 [2023-11-06 22:31:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189723806] [2023-11-06 22:31:27,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:27,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:31:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:31:27,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:31:27,557 INFO L87 Difference]: Start difference. First operand 1527 states and 2138 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 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:31:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:28,693 INFO L93 Difference]: Finished difference Result 3988 states and 5864 transitions. [2023-11-06 22:31:28,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:31:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 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) Word has length 208 [2023-11-06 22:31:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:28,701 INFO L225 Difference]: With dead ends: 3988 [2023-11-06 22:31:28,701 INFO L226 Difference]: Without dead ends: 2721 [2023-11-06 22:31:28,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2023-11-06 22:31:28,705 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 861 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:28,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1554 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:31:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2023-11-06 22:31:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2106. [2023-11-06 22:31:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2105 states have (on average 1.4137767220902613) internal successors, (2976), 2105 states have internal predecessors, (2976), 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:31:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 2976 transitions. [2023-11-06 22:31:28,830 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 2976 transitions. Word has length 208 [2023-11-06 22:31:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:28,830 INFO L495 AbstractCegarLoop]: Abstraction has 2106 states and 2976 transitions. [2023-11-06 22:31:28,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 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:31:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2976 transitions. [2023-11-06 22:31:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-11-06 22:31:28,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:28,836 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:28,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:29,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 22:31:29,045 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:29,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash -642354727, now seen corresponding path program 1 times [2023-11-06 22:31:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:29,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987205617] [2023-11-06 22:31:29,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2023-11-06 22:31:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987205617] [2023-11-06 22:31:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987205617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:29,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:29,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:31:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612765767] [2023-11-06 22:31:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:29,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:29,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:29,948 INFO L87 Difference]: Start difference. First operand 2106 states and 2976 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:31:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:30,675 INFO L93 Difference]: Finished difference Result 2204 states and 3108 transitions. [2023-11-06 22:31:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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) Word has length 208 [2023-11-06 22:31:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:30,682 INFO L225 Difference]: With dead ends: 2204 [2023-11-06 22:31:30,682 INFO L226 Difference]: Without dead ends: 2133 [2023-11-06 22:31:30,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:31:30,683 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 120 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:30,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 441 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:31:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2133 states. [2023-11-06 22:31:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2133 to 2106. [2023-11-06 22:31:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2105 states have (on average 1.41187648456057) internal successors, (2972), 2105 states have internal predecessors, (2972), 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:31:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 2972 transitions. [2023-11-06 22:31:30,772 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 2972 transitions. Word has length 208 [2023-11-06 22:31:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:30,772 INFO L495 AbstractCegarLoop]: Abstraction has 2106 states and 2972 transitions. [2023-11-06 22:31:30,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:31:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2972 transitions. [2023-11-06 22:31:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-06 22:31:30,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:30,778 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:31:30,779 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:30,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash 597944551, now seen corresponding path program 1 times [2023-11-06 22:31:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848125831] [2023-11-06 22:31:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2023-11-06 22:31:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848125831] [2023-11-06 22:31:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848125831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:31,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976440362] [2023-11-06 22:31:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:31,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:31,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:31,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:31,109 INFO L87 Difference]: Start difference. First operand 2106 states and 2972 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:31:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:31,238 INFO L93 Difference]: Finished difference Result 2143 states and 3009 transitions. [2023-11-06 22:31:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:31,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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) Word has length 209 [2023-11-06 22:31:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:31,243 INFO L225 Difference]: With dead ends: 2143 [2023-11-06 22:31:31,244 INFO L226 Difference]: Without dead ends: 2116 [2023-11-06 22:31:31,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:31,245 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 28 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:31,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:31:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2023-11-06 22:31:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2106. [2023-11-06 22:31:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2105 states have (on average 1.4109263657957245) internal successors, (2970), 2105 states have internal predecessors, (2970), 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:31:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 2970 transitions. [2023-11-06 22:31:31,336 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 2970 transitions. Word has length 209 [2023-11-06 22:31:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:31,337 INFO L495 AbstractCegarLoop]: Abstraction has 2106 states and 2970 transitions. [2023-11-06 22:31:31,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:31:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2970 transitions. [2023-11-06 22:31:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-06 22:31:31,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:31,343 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:31,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 22:31:31,343 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:31,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1797459298, now seen corresponding path program 1 times [2023-11-06 22:31:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:31,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740727473] [2023-11-06 22:31:31,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 221 proven. 2 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2023-11-06 22:31:31,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:31,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740727473] [2023-11-06 22:31:31,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740727473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:31,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608615151] [2023-11-06 22:31:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:31,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:31,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:31,777 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:31,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 22:31:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:31,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:31:31,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 136 proven. 115 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2023-11-06 22:31:32,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 236 proven. 15 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2023-11-06 22:31:32,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608615151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:32,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:31:32,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 17 [2023-11-06 22:31:32,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030942037] [2023-11-06 22:31:32,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:32,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:31:32,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:32,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:31:32,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:31:32,859 INFO L87 Difference]: Start difference. First operand 2106 states and 2970 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 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:31:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:35,136 INFO L93 Difference]: Finished difference Result 10194 states and 14676 transitions. [2023-11-06 22:31:35,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-06 22:31:35,137 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 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) Word has length 209 [2023-11-06 22:31:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:35,153 INFO L225 Difference]: With dead ends: 10194 [2023-11-06 22:31:35,153 INFO L226 Difference]: Without dead ends: 7974 [2023-11-06 22:31:35,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1062, Invalid=3228, Unknown=0, NotChecked=0, Total=4290 [2023-11-06 22:31:35,160 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 917 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:35,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2060 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:31:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2023-11-06 22:31:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 3618. [2023-11-06 22:31:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3618 states, 3617 states have (on average 1.4069670998064694) internal successors, (5089), 3617 states have internal predecessors, (5089), 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:31:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 5089 transitions. [2023-11-06 22:31:35,335 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 5089 transitions. Word has length 209 [2023-11-06 22:31:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:35,336 INFO L495 AbstractCegarLoop]: Abstraction has 3618 states and 5089 transitions. [2023-11-06 22:31:35,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 17 states have internal predecessors, (92), 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:31:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 5089 transitions. [2023-11-06 22:31:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-06 22:31:35,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:35,345 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:35,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-06 22:31:35,552 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:35,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash 916439295, now seen corresponding path program 1 times [2023-11-06 22:31:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:35,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646557709] [2023-11-06 22:31:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1321 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2023-11-06 22:31:35,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:35,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646557709] [2023-11-06 22:31:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646557709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:35,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:35,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644538053] [2023-11-06 22:31:35,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:35,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:35,736 INFO L87 Difference]: Start difference. First operand 3618 states and 5089 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:31:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:35,866 INFO L93 Difference]: Finished difference Result 4385 states and 6075 transitions. [2023-11-06 22:31:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:35,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) Word has length 209 [2023-11-06 22:31:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:35,873 INFO L225 Difference]: With dead ends: 4385 [2023-11-06 22:31:35,873 INFO L226 Difference]: Without dead ends: 3416 [2023-11-06 22:31:35,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:35,876 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 117 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:35,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 336 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2023-11-06 22:31:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3369. [2023-11-06 22:31:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3368 states have (on average 1.381828978622328) internal successors, (4654), 3368 states have internal predecessors, (4654), 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:31:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 4654 transitions. [2023-11-06 22:31:36,025 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 4654 transitions. Word has length 209 [2023-11-06 22:31:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:36,025 INFO L495 AbstractCegarLoop]: Abstraction has 3369 states and 4654 transitions. [2023-11-06 22:31:36,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:31:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 4654 transitions. [2023-11-06 22:31:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-06 22:31:36,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:36,037 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:36,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 22:31:36,037 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:36,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:36,038 INFO L85 PathProgramCache]: Analyzing trace with hash 813136288, now seen corresponding path program 1 times [2023-11-06 22:31:36,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:36,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673877085] [2023-11-06 22:31:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2023-11-06 22:31:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:36,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673877085] [2023-11-06 22:31:36,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673877085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:36,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:36,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:31:36,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794534952] [2023-11-06 22:31:36,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:36,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:36,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:36,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:36,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:36,730 INFO L87 Difference]: Start difference. First operand 3369 states and 4654 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:31:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:37,117 INFO L93 Difference]: Finished difference Result 5693 states and 7915 transitions. [2023-11-06 22:31:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:31:37,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) Word has length 209 [2023-11-06 22:31:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:37,127 INFO L225 Difference]: With dead ends: 5693 [2023-11-06 22:31:37,128 INFO L226 Difference]: Without dead ends: 5514 [2023-11-06 22:31:37,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:37,130 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 139 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:37,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 620 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:31:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5514 states. [2023-11-06 22:31:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5514 to 5337. [2023-11-06 22:31:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5337 states, 5336 states have (on average 1.3894302848575713) internal successors, (7414), 5336 states have internal predecessors, (7414), 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:31:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5337 states to 5337 states and 7414 transitions. [2023-11-06 22:31:37,383 INFO L78 Accepts]: Start accepts. Automaton has 5337 states and 7414 transitions. Word has length 209 [2023-11-06 22:31:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:37,383 INFO L495 AbstractCegarLoop]: Abstraction has 5337 states and 7414 transitions. [2023-11-06 22:31:37,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:31:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5337 states and 7414 transitions. [2023-11-06 22:31:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-06 22:31:37,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:37,393 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:37,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-06 22:31:37,394 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:37,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1032230878, now seen corresponding path program 1 times [2023-11-06 22:31:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891793648] [2023-11-06 22:31:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1290 trivial. 0 not checked. [2023-11-06 22:31:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891793648] [2023-11-06 22:31:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891793648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:38,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275058321] [2023-11-06 22:31:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:38,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:38,101 INFO L87 Difference]: Start difference. First operand 5337 states and 7414 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:31:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:39,089 INFO L93 Difference]: Finished difference Result 5561 states and 7722 transitions. [2023-11-06 22:31:39,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:39,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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) Word has length 209 [2023-11-06 22:31:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:39,099 INFO L225 Difference]: With dead ends: 5561 [2023-11-06 22:31:39,100 INFO L226 Difference]: Without dead ends: 5382 [2023-11-06 22:31:39,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:39,102 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 93 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:39,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 371 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:31:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2023-11-06 22:31:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 3368. [2023-11-06 22:31:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.3804573804573805) internal successors, (4648), 3367 states have internal predecessors, (4648), 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:31:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4648 transitions. [2023-11-06 22:31:39,272 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4648 transitions. Word has length 209 [2023-11-06 22:31:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:39,273 INFO L495 AbstractCegarLoop]: Abstraction has 3368 states and 4648 transitions. [2023-11-06 22:31:39,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:31:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4648 transitions. [2023-11-06 22:31:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-11-06 22:31:39,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:39,280 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 22:31:39,281 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:39,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:39,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2134516202, now seen corresponding path program 1 times [2023-11-06 22:31:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:39,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757120516] [2023-11-06 22:31:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:39,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2023-11-06 22:31:39,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757120516] [2023-11-06 22:31:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757120516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:39,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988213000] [2023-11-06 22:31:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:39,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:39,876 INFO L87 Difference]: Start difference. First operand 3368 states and 4648 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:40,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:40,093 INFO L93 Difference]: Finished difference Result 3437 states and 4750 transitions. [2023-11-06 22:31:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:40,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) Word has length 210 [2023-11-06 22:31:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:40,100 INFO L225 Difference]: With dead ends: 3437 [2023-11-06 22:31:40,100 INFO L226 Difference]: Without dead ends: 3382 [2023-11-06 22:31:40,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:40,101 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 6 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:40,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 290 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:31:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2023-11-06 22:31:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 3374. [2023-11-06 22:31:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3374 states, 3373 states have (on average 1.3797806107322859) internal successors, (4654), 3373 states have internal predecessors, (4654), 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:31:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4654 transitions. [2023-11-06 22:31:40,249 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4654 transitions. Word has length 210 [2023-11-06 22:31:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:40,250 INFO L495 AbstractCegarLoop]: Abstraction has 3374 states and 4654 transitions. [2023-11-06 22:31:40,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:31:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4654 transitions. [2023-11-06 22:31:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-11-06 22:31:40,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:40,258 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:40,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-06 22:31:40,258 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:40,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash 880587416, now seen corresponding path program 1 times [2023-11-06 22:31:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:40,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579477700] [2023-11-06 22:31:40,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 297 proven. 10 refuted. 0 times theorem prover too weak. 1029 trivial. 0 not checked. [2023-11-06 22:31:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:41,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579477700] [2023-11-06 22:31:41,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579477700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:41,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540104816] [2023-11-06 22:31:41,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:41,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:41,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:41,708 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:41,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 22:31:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:41,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 22:31:41,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 297 proven. 10 refuted. 0 times theorem prover too weak. 1029 trivial. 0 not checked. [2023-11-06 22:31:42,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 343 proven. 5 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2023-11-06 22:31:42,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540104816] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:42,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:31:42,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2023-11-06 22:31:42,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465238160] [2023-11-06 22:31:42,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:42,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 22:31:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:42,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:31:42,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:31:42,442 INFO L87 Difference]: Start difference. First operand 3374 states and 4654 transitions. Second operand has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 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:31:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:46,066 INFO L93 Difference]: Finished difference Result 11788 states and 16614 transitions. [2023-11-06 22:31:46,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-06 22:31:46,067 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 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) Word has length 210 [2023-11-06 22:31:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:46,082 INFO L225 Difference]: With dead ends: 11788 [2023-11-06 22:31:46,083 INFO L226 Difference]: Without dead ends: 8460 [2023-11-06 22:31:46,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=727, Invalid=4529, Unknown=0, NotChecked=0, Total=5256 [2023-11-06 22:31:46,089 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 256 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:46,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1357 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:31:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8460 states. [2023-11-06 22:31:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8460 to 5611. [2023-11-06 22:31:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5611 states, 5610 states have (on average 1.406060606060606) internal successors, (7888), 5610 states have internal predecessors, (7888), 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:31:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5611 states to 5611 states and 7888 transitions. [2023-11-06 22:31:46,395 INFO L78 Accepts]: Start accepts. Automaton has 5611 states and 7888 transitions. Word has length 210 [2023-11-06 22:31:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:46,395 INFO L495 AbstractCegarLoop]: Abstraction has 5611 states and 7888 transitions. [2023-11-06 22:31:46,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 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:31:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 5611 states and 7888 transitions. [2023-11-06 22:31:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-11-06 22:31:46,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:46,407 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:46,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:46,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-06 22:31:46,614 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:46,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:46,614 INFO L85 PathProgramCache]: Analyzing trace with hash 535080598, now seen corresponding path program 1 times [2023-11-06 22:31:46,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:46,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086820072] [2023-11-06 22:31:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:46,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:31:47,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:31:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:31:47,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:31:47,512 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:31:47,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:31:47,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-06 22:31:47,519 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 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:31:47,524 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:31:47,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:31:47 BoogieIcfgContainer [2023-11-06 22:31:47,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:31:47,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:31:47,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:31:47,653 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:31:47,654 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:30:26" (3/4) ... [2023-11-06 22:31:47,657 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:31:47,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:31:47,661 INFO L158 Benchmark]: Toolchain (without parser) took 84847.91ms. Allocated memory was 146.8MB in the beginning and 564.1MB in the end (delta: 417.3MB). Free memory was 100.2MB in the beginning and 318.9MB in the end (delta: -218.7MB). Peak memory consumption was 201.6MB. Max. memory is 16.1GB. [2023-11-06 22:31:47,663 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 98.6MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:31:47,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.59ms. Allocated memory is still 146.8MB. Free memory was 100.0MB in the beginning and 88.7MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:31:47,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.05ms. Allocated memory is still 146.8MB. Free memory was 88.7MB in the beginning and 86.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:31:47,669 INFO L158 Benchmark]: Boogie Preprocessor took 47.57ms. Allocated memory is still 146.8MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:31:47,669 INFO L158 Benchmark]: RCFGBuilder took 2847.44ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 84.5MB in the beginning and 148.1MB in the end (delta: -63.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-11-06 22:31:47,672 INFO L158 Benchmark]: TraceAbstraction took 81596.84ms. Allocated memory was 186.6MB in the beginning and 564.1MB in the end (delta: 377.5MB). Free memory was 148.1MB in the beginning and 319.9MB in the end (delta: -171.8MB). Peak memory consumption was 204.7MB. Max. memory is 16.1GB. [2023-11-06 22:31:47,672 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 564.1MB. Free memory is still 318.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:31:47,673 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 98.6MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.59ms. Allocated memory is still 146.8MB. Free memory was 100.0MB in the beginning and 88.7MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.05ms. Allocated memory is still 146.8MB. Free memory was 88.7MB in the beginning and 86.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.57ms. Allocated memory is still 146.8MB. Free memory was 86.3MB in the beginning and 84.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2847.44ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 84.5MB in the beginning and 148.1MB in the end (delta: -63.6MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 81596.84ms. Allocated memory was 186.6MB in the beginning and 564.1MB in the end (delta: 377.5MB). Free memory was 148.1MB in the beginning and 319.9MB in the end (delta: -171.8MB). Peak memory consumption was 204.7MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 564.1MB. Free memory is still 318.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseAnd at line 59. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=0, z=0] [L50] EXPR 1U << i VAL [1U << i=1, i=0, z=0] [L50] EXPR x & (1U << i) VAL [1U << i=1, i=0, x & (1U << i)=0, x=0, z=0] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=1, i=0, x & (1U << i)=0, x=0, z=0] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=1, 1U << i=1, i=0, x & (1U << i)=0, x=0, z=0] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=1, 1U << i=1, i=0, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=4294967295, 1U << i=1, 1U << i=1, i=0, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=4294967295, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=4294967295, 1U << i=1, 1U << i=1, i=0, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=1, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=1, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=1, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=1, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=1, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=1, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=1, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=1, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=2, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=2, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=2, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=2, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=2, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=2, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=2, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=2, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=3, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=3, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=3, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=3, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=3, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=3, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=3, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=3, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=4, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=4, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=4, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=4, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=4, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=4, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=4, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=4, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=5, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=5, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=5, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=5, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=5, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=5, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=5, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=5, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=6, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=6, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=6, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=6, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=6, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=6, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=6, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=6, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=7, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=7, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=7, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=7, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=7, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=7, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=7, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=7, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=8, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=8, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=8, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=8, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=8, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=8, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=8, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=8, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=9, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=9, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=9, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=9, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=9, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=9, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=9, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=9, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=10, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=10, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=10, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=10, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=10, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=10, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=10, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=10, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=11, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=11, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=11, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=11, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=11, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=11, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=11, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=11, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=12, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=12, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=12, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=12, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=12, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=12, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=12, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=12, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=13, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=13, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=13, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=13, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=13, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=13, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=13, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=13, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=14, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=14, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=14, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=14, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=14, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=14, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=14, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=14, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, x=0, y=1, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=15, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [1U << i=2, i=15, x=0, y=1, z=4294967295] [L50] EXPR x & (1U << i) VAL [1U << i=2, i=15, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR (x & (1U << i)) << i VAL [(x & (1U << i)) << i=0, 1U << i=2, i=15, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR 1U << i VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=15, x & (1U << i)=0, x=0, y=1, z=4294967295] [L50] EXPR y & (1U << i) VAL [(x & (1U << i)) << i=0, 1U << i=2, 1U << i=2, i=15, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [(x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=15, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1))=-1, (x & (1U << i)) << i=0, (y & (1U << i)) << (i + 1)=-1, 1U << i=2, 1U << i=2, i=15, x & (1U << i)=0, x=0, y & (1U << i)=1, y=1, z=4294967295] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, x=0, y=1, z=4294967295] [L49] COND FALSE !(i < sizeof(x) * 8) VAL [i=16, x=0, y=1, z=4294967295] [L53] xx = x [L54] yy = y VAL [i=16, x=0, xx=0, y=1, yy=1, z=4294967295] [L55] EXPR xx | (xx << 8u) VAL [i=16, x=0, xx | (xx << 8u)=0, xx=0, y=1, yy=1, z=4294967295] [L55] EXPR (xx | (xx << 8u)) & 16711935U VAL [(xx | (xx << 8u)) & 16711935U=0, i=16, x=0, xx | (xx << 8u)=0, xx=0, y=1, yy=1, z=4294967295] [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] EXPR xx | (xx << 4u) VAL [i=16, x=0, xx | (xx << 4u)=0, xx=0, y=1, yy=1, z=4294967295] [L56] EXPR (xx | (xx << 4u)) & 252645135U VAL [(xx | (xx << 4u)) & 252645135U=0, i=16, x=0, xx | (xx << 4u)=0, xx=0, y=1, yy=1, z=4294967295] [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] EXPR xx | (xx << 2u) VAL [i=16, x=0, xx | (xx << 2u)=0, xx=0, y=1, yy=1, z=4294967295] [L57] EXPR (xx | (xx << 2u)) & 858993459U VAL [(xx | (xx << 2u)) & 858993459U=0, i=16, x=0, xx | (xx << 2u)=0, xx=0, y=1, yy=1, z=4294967295] [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] EXPR xx | (xx << 1u) VAL [i=16, x=0, xx | (xx << 1u)=0, xx=0, y=1, yy=1, z=4294967295] [L58] EXPR (xx | (xx << 1u)) & 1431655765U VAL [(xx | (xx << 1u)) & 1431655765U=0, i=16, x=0, xx | (xx << 1u)=0, xx=0, y=1, yy=1, z=4294967295] [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] EXPR yy | (yy << 8u) VAL [i=16, x=0, xx=0, y=1, yy | (yy << 8u)=256, yy=1, z=4294967295] [L59] EXPR (yy | (yy << 8u)) & 16711935U VAL [(yy | (yy << 8u)) & 16711935U=0, i=16, x=0, xx=0, y=1, yy | (yy << 8u)=256, yy=1, z=4294967295] [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] EXPR yy | (yy << 4u) VAL [i=16, x=0, xx=0, y=1, yy | (yy << 4u)=0, yy=0, z=4294967295] [L60] EXPR (yy | (yy << 4u)) & 252645135U VAL [(yy | (yy << 4u)) & 252645135U=0, i=16, x=0, xx=0, y=1, yy | (yy << 4u)=0, yy=0, z=4294967295] [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] EXPR yy | (yy << 2u) VAL [i=16, x=0, xx=0, y=1, yy | (yy << 2u)=0, yy=0, z=4294967295] [L61] EXPR (yy | (yy << 2u)) & 858993459U VAL [(yy | (yy << 2u)) & 858993459U=0, i=16, x=0, xx=0, y=1, yy | (yy << 2u)=0, yy=0, z=4294967295] [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] EXPR yy | (yy << 1u) VAL [i=16, x=0, xx=0, y=1, yy | (yy << 1u)=0, yy=0, z=4294967295] [L62] EXPR (yy | (yy << 1u)) & 1431655765U VAL [(yy | (yy << 1u)) & 1431655765U=0, i=16, x=0, xx=0, y=1, yy | (yy << 1u)=0, yy=0, z=4294967295] [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] EXPR xx | (yy << 1U) VAL [i=16, x=0, xx | (yy << 1U)=0, xx=0, y=1, yy=0, z=4294967295] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.4s, OverallIterations: 35, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 43.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 5918 SdHoareTripleChecker+Valid, 28.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5918 mSDsluCounter, 20181 SdHoareTripleChecker+Invalid, 27.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15953 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4506 IncrementalHoareTripleChecker+Invalid, 4838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 4228 mSDtfsCounter, 4506 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4504 GetRequests, 4098 SyntacticMatches, 18 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3533 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5611occurred in iteration=34, InterpolantAutomatonStates: 372, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 11114 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 8545 NumberOfCodeBlocks, 8545 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 9936 ConstructedInterpolants, 0 QuantifiedInterpolants, 32377 SizeOfPredicates, 51 NumberOfNonLiveVariables, 6975 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 58 InterpolantComputations, 24 PerfectInterpolantSequences, 56277/58313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:31:47,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/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_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/interleave_bits.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:31:50,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:31:50,425 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:31:50,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:31:50,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:31:50,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:31:50,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:31:50,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:31:50,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:31:50,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:31:50,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:31:50,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:31:50,494 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:31:50,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:31:50,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:31:50,498 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:31:50,498 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:31:50,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:31:50,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:31:50,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:31:50,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:31:50,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:31:50,501 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:31:50,502 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:31:50,502 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:31:50,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:31:50,503 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:31:50,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:31:50,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:31:50,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:31:50,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:31:50,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:31:50,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:31:50,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:31:50,507 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:31:50,507 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:31:50,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:31:50,508 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:31:50,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:31:50,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:31:50,510 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:31:50,510 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:31:50,510 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_9149d7a4-6402-49b1-a276-3a5ac3994c29/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_9149d7a4-6402-49b1-a276-3a5ac3994c29/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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2023-11-06 22:31:50,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:31:51,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:31:51,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:31:51,008 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:31:51,008 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:31:51,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/bitvector/interleave_bits.i [2023-11-06 22:31:54,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:31:54,401 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:31:54,402 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/sv-benchmarks/c/bitvector/interleave_bits.i [2023-11-06 22:31:54,409 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/data/bc07c31ab/9015a1e30f1a4b98a310e98e76748cd3/FLAG4a85fe73d [2023-11-06 22:31:54,422 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/data/bc07c31ab/9015a1e30f1a4b98a310e98e76748cd3 [2023-11-06 22:31:54,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:31:54,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:31:54,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:31:54,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:31:54,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:31:54,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175f5ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54, skipping insertion in model container [2023-11-06 22:31:54,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,459 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:31:54,642 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_9149d7a4-6402-49b1-a276-3a5ac3994c29/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-11-06 22:31:54,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:31:54,700 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:31:54,716 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_9149d7a4-6402-49b1-a276-3a5ac3994c29/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-11-06 22:31:54,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:31:54,763 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:31:54,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54 WrapperNode [2023-11-06 22:31:54,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:31:54,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:31:54,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:31:54,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:31:54,774 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:31:54" (1/1) ... [2023-11-06 22:31:54,783 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:31:54" (1/1) ... [2023-11-06 22:31:54,808 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-11-06 22:31:54,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:31:54,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:31:54,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:31:54,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:31:54,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:31:54,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:31:54,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:31:54,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:31:54,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (1/1) ... [2023-11-06 22:31:54,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:31:54,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:54,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/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:31:54,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/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:31:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:31:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:31:54,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:31:54,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:31:55,035 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:31:55,038 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:31:55,291 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:31:55,297 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:31:55,298 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:31:55,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:55 BoogieIcfgContainer [2023-11-06 22:31:55,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:31:55,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:31:55,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:31:55,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:31:55,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:31:54" (1/3) ... [2023-11-06 22:31:55,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244af749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:55, skipping insertion in model container [2023-11-06 22:31:55,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:54" (2/3) ... [2023-11-06 22:31:55,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244af749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:55, skipping insertion in model container [2023-11-06 22:31:55,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:55" (3/3) ... [2023-11-06 22:31:55,313 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2023-11-06 22:31:55,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:31:55,354 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:31:55,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:31:55,438 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;@78032a79, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:31:55,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:31:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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:31:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 22:31:55,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:55,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:31:55,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:55,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2023-11-06 22:31:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:31:55,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414566224] [2023-11-06 22:31:55,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:55,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:31:55,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:31:55,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:31:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:31:55,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:55,621 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:31:55,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:31:55,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414566224] [2023-11-06 22:31:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414566224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:31:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651387808] [2023-11-06 22:31:55,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:55,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:31:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:31:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:31:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:31:55,662 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:31:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:55,689 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-11-06 22:31:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:31:55,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2023-11-06 22:31:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:55,700 INFO L225 Difference]: With dead ends: 20 [2023-11-06 22:31:55,701 INFO L226 Difference]: Without dead ends: 8 [2023-11-06 22:31:55,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:31:55,707 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:55,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-06 22:31:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-06 22:31:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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:31:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-06 22:31:55,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-11-06 22:31:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:55,742 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-06 22:31:55,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:31:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-06 22:31:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:31:55,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:55,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:55,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:55,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:55,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:55,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2023-11-06 22:31:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:31:55,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636671278] [2023-11-06 22:31:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:55,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:55,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:31:55,958 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:31:55,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:31:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:56,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:31:56,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:56,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:56,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:31:56,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636671278] [2023-11-06 22:31:56,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636671278] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:56,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:31:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-06 22:31:56,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379692566] [2023-11-06 22:31:56,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:56,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:31:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:31:56,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:31:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:31:56,126 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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:31:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:56,188 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-11-06 22:31:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:31:56,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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) Word has length 7 [2023-11-06 22:31:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:56,190 INFO L225 Difference]: With dead ends: 15 [2023-11-06 22:31:56,190 INFO L226 Difference]: Without dead ends: 11 [2023-11-06 22:31:56,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:56,193 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:56,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-06 22:31:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-06 22:31:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:31:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-11-06 22:31:56,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-11-06 22:31:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:56,211 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-11-06 22:31:56,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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:31:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-11-06 22:31:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:31:56,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:56,213 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:56,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:56,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:56,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:56,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2023-11-06 22:31:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:31:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345248658] [2023-11-06 22:31:56,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:31:56,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:31:56,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:31:56,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:31:56,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:31:56,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:31:56,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:31:56,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:56,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:56,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:31:56,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345248658] [2023-11-06 22:31:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345248658] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:56,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:31:56,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-06 22:31:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350772967] [2023-11-06 22:31:56,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:56,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:31:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:31:56,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:31:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:31:56,725 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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:31:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:56,936 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-11-06 22:31:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:31:56,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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) Word has length 10 [2023-11-06 22:31:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:56,938 INFO L225 Difference]: With dead ends: 21 [2023-11-06 22:31:56,938 INFO L226 Difference]: Without dead ends: 17 [2023-11-06 22:31:56,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:31:56,940 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:56,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:31:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-11-06 22:31:56,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-11-06 22:31:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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:31:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-11-06 22:31:56,948 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-11-06 22:31:56,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:56,948 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-11-06 22:31:56,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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:31:56,949 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-11-06 22:31:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:31:56,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:56,950 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:56,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:57,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:57,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:57,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:57,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2023-11-06 22:31:57,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:31:57,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468727862] [2023-11-06 22:31:57,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:31:57,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:57,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:31:57,170 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:31:57,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:31:57,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-06 22:31:57,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:31:57,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:31:57,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:57,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:58,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:31:58,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468727862] [2023-11-06 22:31:58,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468727862] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:31:58,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:31:58,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-11-06 22:31:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380141794] [2023-11-06 22:31:58,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:58,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:31:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:31:58,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:31:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:31:58,091 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:31:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:59,381 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-11-06 22:31:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:31:59,382 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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) Word has length 16 [2023-11-06 22:31:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:59,383 INFO L225 Difference]: With dead ends: 33 [2023-11-06 22:31:59,383 INFO L226 Difference]: Without dead ends: 29 [2023-11-06 22:31:59,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:31:59,387 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:59,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:31:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-06 22:31:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-06 22:31:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 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:31:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-11-06 22:31:59,399 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2023-11-06 22:31:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:59,400 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-11-06 22:31:59,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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:31:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-11-06 22:31:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:31:59,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:59,401 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:59,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:31:59,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:59,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:59,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2023-11-06 22:31:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:31:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567246317] [2023-11-06 22:31:59,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:31:59,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:31:59,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:31:59,619 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:31:59,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:31:59,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:31:59,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:31:59,770 WARN L260 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-06 22:31:59,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:01,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:32:57,442 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~y~0#1| (_ BitVec 16))) (let ((.cse0 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|))) (= (bvor (bvor (bvor (bvshl (bvand .cse0 (_ bv16384 32)) (_ bv15 32)) (bvshl (bvand .cse1 (_ bv16384 32)) (_ bv14 32))) (bvor (bvor (bvor (bvor (bvshl (bvand .cse1 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse0 (_ bv2048 32)) (_ bv12 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv1024 32)) (_ bv11 32)) (bvshl (bvand .cse1 (_ bv1024 32)) (_ bv10 32))) (bvor (bvor (bvor (bvor (bvshl (bvand .cse0 (_ bv128 32)) (_ bv8 32)) (bvshl (bvand .cse1 (_ bv128 32)) (_ bv7 32))) (bvor (bvor (bvor (bvor (bvshl (bvand (_ bv16 32) .cse1) (_ bv4 32)) (bvshl (bvand .cse0 (_ bv16 32)) (_ bv5 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv8 32)) (_ bv4 32)) (bvshl (bvand .cse1 (_ bv8 32)) (_ bv3 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv4 32)) (_ bv3 32)) (bvshl (bvand .cse1 (_ bv4 32)) (_ bv2 32))) (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse0 (_ bv1 32)) (_ bv1 32)) (bvshl (bvand .cse1 (_ bv1 32)) (_ bv0 32)))) (bvor (bvshl (bvand .cse1 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse0 (_ bv2 32)) (_ bv2 32))))))) (bvor (bvshl (bvand .cse0 (_ bv32 32)) (_ bv6 32)) (bvshl (bvand .cse1 (_ bv32 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse0 (_ bv64 32)) (_ bv7 32)) (bvshl (bvand .cse1 (_ bv64 32)) (_ bv6 32))))) (bvor (bvshl (bvand (_ bv256 32) .cse1) (_ bv8 32)) (bvshl (bvand .cse0 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse1 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse0 (_ bv512 32)) (_ bv10 32)))))) (bvor (bvshl (bvand .cse1 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse0 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse0 (_ bv8192 32)) (_ bv14 32)) (bvshl (bvand .cse1 (_ bv8192 32)) (_ bv13 32))))) (bvor (bvshl (bvand .cse0 (_ bv32768 32)) (_ bv16 32)) (bvshl (bvand .cse1 (_ bv32768 32)) (_ bv15 32)))) (let ((.cse31 (bvadd (_ bv15 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse29 (bvadd (_ bv14 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse4 (bvadd (_ bv13 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse3 (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse2 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse1 .cse2) .cse3) (bvshl (bvand .cse0 .cse2) .cse4))) (let ((.cse6 (bvadd (_ bv11 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse5 (bvshl (_ bv1 32) .cse6))) (bvor (bvshl (bvand .cse0 .cse5) .cse3) (bvshl (bvand .cse1 .cse5) .cse6))) (let ((.cse8 (bvadd (_ bv10 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse7 (bvshl (_ bv1 32) .cse8))) (bvor (bvshl (bvand .cse1 .cse7) .cse8) (bvshl (bvand .cse0 .cse7) .cse6))) (let ((.cse26 (bvadd (_ bv9 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse10 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse11 (bvadd (_ bv7 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse9 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse0 .cse9) .cse10) (bvshl (bvand .cse1 .cse9) .cse11))) (let ((.cse13 (bvadd (_ bv6 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse14 (bvadd (_ bv5 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse12 (bvshl (_ bv1 32) .cse14))) (bvor (bvshl (bvand .cse0 .cse12) .cse13) (bvshl (bvand .cse1 .cse12) .cse14))) (let ((.cse16 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse15 (bvshl (_ bv1 32) .cse16))) (bvor (bvshl (bvand .cse0 .cse15) .cse14) (bvshl (bvand .cse1 .cse15) .cse16))) (let ((.cse18 (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse17 (bvshl (_ bv1 32) .cse18))) (bvor (bvshl (bvand .cse0 .cse17) .cse16) (bvshl (bvand .cse1 .cse17) .cse18))) (let ((.cse22 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse20 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvor |c_ULTIMATE.start_main_~z~0#1| (let ((.cse19 (bvshl (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvshl (bvand .cse0 .cse19) .cse20) (bvshl (bvand .cse1 .cse19) |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse21 (bvshl (_ bv1 32) .cse20))) (bvor (bvshl (bvand .cse1 .cse21) .cse20) (bvshl (bvand .cse0 .cse21) .cse22))))) (let ((.cse23 (bvshl (_ bv1 32) .cse22))) (bvor (bvshl (bvand .cse1 .cse23) .cse22) (bvshl (bvand .cse0 .cse23) .cse18))))))))))) (let ((.cse24 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse0 .cse24) .cse11) (bvshl (bvand .cse1 .cse24) .cse13))))))) (let ((.cse25 (bvshl (_ bv1 32) .cse10))) (bvor (bvshl (bvand .cse1 .cse25) .cse10) (bvshl (bvand .cse0 .cse25) .cse26))))) (let ((.cse27 (bvshl (_ bv1 32) .cse26))) (bvor (bvshl (bvand .cse1 .cse27) .cse26) (bvshl (bvand .cse0 .cse27) .cse8))))))))))) (let ((.cse28 (bvshl (_ bv1 32) .cse4))) (bvor (bvshl (bvand .cse28 .cse1) .cse4) (bvshl (bvand .cse0 .cse28) .cse29))))) (let ((.cse30 (bvshl (_ bv1 32) .cse29))) (bvor (bvshl (bvand .cse1 .cse30) .cse29) (bvshl (bvand .cse0 .cse30) .cse31))))) (let ((.cse32 (bvshl (_ bv1 32) .cse31))) (bvor (bvshl (bvand .cse32 .cse0) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~i~0#1|)) (bvshl (bvand .cse32 .cse1) .cse31)))))))) is different from false [2023-11-06 22:32:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-11-06 22:32:57,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:57,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567246317] [2023-11-06 22:32:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567246317] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:32:57,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:32:57,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2023-11-06 22:32:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336174476] [2023-11-06 22:32:57,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:32:57,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-06 22:32:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-06 22:32:57,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2023-11-06 22:32:57,528 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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:32:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:32:59,512 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-11-06 22:32:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:32:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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) Word has length 22 [2023-11-06 22:32:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:32:59,514 INFO L225 Difference]: With dead ends: 29 [2023-11-06 22:32:59,514 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:32:59,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 56.3s TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2023-11-06 22:32:59,521 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:32:59,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 19 Unchecked, 1.7s Time] [2023-11-06 22:32:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:32:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:32:59,523 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:32:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:32:59,529 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2023-11-06 22:32:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:32:59,530 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:32:59,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 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:32:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:32:59,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:32:59,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:32:59,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:32:59,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:32:59,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:33:00,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:33:00,343 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2023-11-06 22:33:00,343 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:33:00,344 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 67) no Hoare annotation was computed. [2023-11-06 22:33:00,344 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:33:00,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:33:00,344 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2023-11-06 22:33:00,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2023-11-06 22:33:00,344 INFO L902 garLoopResultBuilder]: At program point L24-2(lines 23 28) the Hoare annotation is: true [2023-11-06 22:33:00,345 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 52) the Hoare annotation is: (let ((.cse5 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|)) (.cse6 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse8 (bvor (_ bv0 32) (bvor (bvshl (bvand .cse5 (_ bv1 32)) (_ bv1 32)) (bvshl (bvand .cse6 (_ bv1 32)) (_ bv0 32)))))) (let ((.cse14 (bvor .cse8 (bvor (bvshl (bvand .cse6 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse5 (_ bv2 32)) (_ bv2 32)))))) (let ((.cse1 (bvor (bvor (bvshl (bvand .cse5 (_ bv4 32)) (_ bv3 32)) (bvshl (bvand .cse6 (_ bv4 32)) (_ bv2 32))) .cse14))) (let ((.cse2 (bvor (bvor (bvshl (bvand .cse5 (_ bv8 32)) (_ bv4 32)) (bvshl (bvand .cse6 (_ bv8 32)) (_ bv3 32))) .cse1))) (let ((.cse16 (bvor (bvor (bvshl (bvand (_ bv16 32) .cse6) (_ bv4 32)) (bvshl (bvand .cse5 (_ bv16 32)) (_ bv5 32))) .cse2))) (let ((.cse13 (bvor .cse16 (bvor (bvshl (bvand .cse5 (_ bv32 32)) (_ bv6 32)) (bvshl (bvand .cse6 (_ bv32 32)) (_ bv5 32)))))) (let ((.cse7 (bvor .cse13 (bvor (bvshl (bvand .cse5 (_ bv64 32)) (_ bv7 32)) (bvshl (bvand .cse6 (_ bv64 32)) (_ bv6 32)))))) (let ((.cse12 (bvor (bvor (bvshl (bvand .cse5 (_ bv128 32)) (_ bv8 32)) (bvshl (bvand .cse6 (_ bv128 32)) (_ bv7 32))) .cse7))) (let ((.cse3 (bvor .cse12 (bvor (bvshl (bvand (_ bv256 32) .cse6) (_ bv8 32)) (bvshl (bvand .cse5 (_ bv256 32)) (_ bv9 32)))))) (let ((.cse4 (bvor .cse3 (bvor (bvshl (bvand .cse6 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse5 (_ bv512 32)) (_ bv10 32)))))) (let ((.cse9 (bvor (bvor (bvshl (bvand .cse5 (_ bv1024 32)) (_ bv11 32)) (bvshl (bvand .cse6 (_ bv1024 32)) (_ bv10 32))) .cse4))) (let ((.cse10 (bvor (bvor (bvshl (bvand .cse6 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse5 (_ bv2048 32)) (_ bv12 32))) .cse9))) (let ((.cse15 (bvor .cse10 (bvor (bvshl (bvand .cse6 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse5 (_ bv4096 32)) (_ bv13 32)))))) (let ((.cse11 (bvor .cse15 (bvor (bvshl (bvand .cse5 (_ bv8192 32)) (_ bv14 32)) (bvshl (bvand .cse6 (_ bv8192 32)) (_ bv13 32)))))) (let ((.cse0 (bvor (bvor (bvshl (bvand .cse5 (_ bv16384 32)) (_ bv15 32)) (bvshl (bvand .cse6 (_ bv16384 32)) (_ bv14 32))) .cse11))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv15 32)) (= |ULTIMATE.start_main_~z~0#1| .cse0)) (and (= |ULTIMATE.start_main_~z~0#1| .cse1) (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))) (and (= |ULTIMATE.start_main_~z~0#1| .cse2) (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (= |ULTIMATE.start_main_~z~0#1| .cse3)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (= |ULTIMATE.start_main_~z~0#1| .cse4)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse0 (bvor (bvshl (bvand .cse5 (_ bv32768 32)) (_ bv16 32)) (bvshl (bvand .cse6 (_ bv32768 32)) (_ bv15 32))))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (= |ULTIMATE.start_main_~z~0#1| .cse7)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~z~0#1| .cse8)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv11 32)) (= |ULTIMATE.start_main_~z~0#1| .cse9)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv12 32)) (= |ULTIMATE.start_main_~z~0#1| .cse10)) (and (= (_ bv14 32) |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~z~0#1| .cse11)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (= |ULTIMATE.start_main_~z~0#1| .cse12)) (and (= .cse13 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~z~0#1| .cse14) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~z~0#1| (_ bv0 32))) (and (= .cse15 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv13 32))) (and (= .cse16 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32)))))))))))))))))))) [2023-11-06 22:33:00,345 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 52) no Hoare annotation was computed. [2023-11-06 22:33:00,349 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-11-06 22:33:00,351 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:33:00,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:33:00 BoogieIcfgContainer [2023-11-06 22:33:00,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:33:00,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:33:00,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:33:00,409 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:33:00,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:55" (3/4) ... [2023-11-06 22:33:00,412 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:33:00,420 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-06 22:33:00,420 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:33:00,421 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:33:00,421 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:33:00,481 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:33:00,482 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:33:00,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:33:00,483 INFO L158 Benchmark]: Toolchain (without parser) took 66056.95ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 89.0MB in the beginning and 84.6MB in the end (delta: 4.4MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2023-11-06 22:33:00,483 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 75.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:33:00,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.46ms. Allocated memory is still 113.2MB. Free memory was 88.7MB in the beginning and 77.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:33:00,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.62ms. Allocated memory is still 113.2MB. Free memory was 77.4MB in the beginning and 75.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:33:00,484 INFO L158 Benchmark]: Boogie Preprocessor took 49.36ms. Allocated memory is still 113.2MB. Free memory was 75.9MB in the beginning and 74.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:33:00,485 INFO L158 Benchmark]: RCFGBuilder took 441.79ms. Allocated memory is still 113.2MB. Free memory was 74.7MB in the beginning and 91.7MB in the end (delta: -17.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2023-11-06 22:33:00,485 INFO L158 Benchmark]: TraceAbstraction took 65104.33ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 90.8MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2023-11-06 22:33:00,486 INFO L158 Benchmark]: Witness Printer took 73.06ms. Allocated memory is still 136.3MB. Free memory was 88.8MB in the beginning and 84.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:33:00,488 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 75.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.46ms. Allocated memory is still 113.2MB. Free memory was 88.7MB in the beginning and 77.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.62ms. Allocated memory is still 113.2MB. Free memory was 77.4MB in the beginning and 75.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.36ms. Allocated memory is still 113.2MB. Free memory was 75.9MB in the beginning and 74.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.79ms. Allocated memory is still 113.2MB. Free memory was 74.7MB in the beginning and 91.7MB in the end (delta: -17.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 65104.33ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 90.8MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Witness Printer took 73.06ms. Allocated memory is still 136.3MB. Free memory was 88.8MB in the beginning and 84.6MB 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: 25]: 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 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.9s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 504 IncrementalHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 30 mSDtfsCounter, 504 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 58.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 25 NumberOfFragments, 2021 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1842 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 58.9s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 10021 SizeOfPredicates, 9 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 120/404 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: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((((i == 15) && (z == ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | ((((y & 1024) << 11) | ((x & 1024) << 10)) | ((((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))) | (((256 & x) << 8) | ((y & 256) << 9))) | (((x & 512) << 9) | ((y & 512) << 10))))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))))) || ((z == ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2))))) && (i == 3))) || ((z == ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) && (4 == i))) || ((i == 9) && (z == (((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))) | (((256 & x) << 8) | ((y & 256) << 9)))))) || ((i == 10) && (z == ((((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))) | (((256 & x) << 8) | ((y & 256) << 9))) | (((x & 512) << 9) | ((y & 512) << 10)))))) || (z == (((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | ((((y & 1024) << 11) | ((x & 1024) << 10)) | ((((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))) | (((256 & x) << 8) | ((y & 256) << 9))) | (((x & 512) << 9) | ((y & 512) << 10))))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))) | (((y & 32768) << 16) | ((x & 32768) << 15))))) || ((i == 7) && (z == ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))))) || ((i == 1) && (z == (0 | (((y & 1) << 1) | ((x & 1) << 0)))))) || ((i == 11) && (z == ((((y & 1024) << 11) | ((x & 1024) << 10)) | ((((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))) | (((256 & x) << 8) | ((y & 256) << 9))) | (((x & 512) << 9) | ((y & 512) << 10))))))) || ((i == 12) && (z == ((((x & 2048) << 11) | ((y & 2048) << 12)) | ((((y & 1024) << 11) | ((x & 1024) << 10)) | ((((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))) | (((256 & x) << 8) | ((y & 256) << 9))) | (((x & 512) << 9) | ((y & 512) << 10)))))))) || ((14 == i) && (z == ((((((x & 2048) << 11) | ((y & 2048) << 12)) | ((((y & 1024) << 11) | ((x & 1024) << 10)) | ((((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))) | (((256 & x) << 8) | ((y & 256) << 9))) | (((x & 512) << 9) | ((y & 512) << 10))))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))))) || ((i == 8) && (z == ((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6))))))) || (((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) == z) && (i == 6))) || ((z == ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))) && (i == 2))) || ((i == 0) && (z == 0))) || (((((((x & 2048) << 11) | ((y & 2048) << 12)) | ((((y & 1024) << 11) | ((x & 1024) << 10)) | ((((((y & 128) << 8) | ((x & 128) << 7)) | ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) | (((y & 32) << 6) | ((x & 32) << 5))) | (((y & 64) << 7) | ((x & 64) << 6)))) | (((256 & x) << 8) | ((y & 256) << 9))) | (((x & 512) << 9) | ((y & 512) << 10))))) | (((x & 4096) << 12) | ((y & 4096) << 13))) == z) && (i == 13))) || ((((((16 & x) << 4) | ((y & 16) << 5)) | ((((y & 8) << 4) | ((x & 8) << 3)) | ((((y & 4) << 3) | ((x & 4) << 2)) | ((0 | (((y & 1) << 1) | ((x & 1) << 0))) | (((x & 2) << 1) | ((y & 2) << 2)))))) == z) && (i == 5))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:33:00,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9149d7a4-6402-49b1-a276-3a5ac3994c29/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE