./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 64bit --witnessprinter.graph.data.programhash 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:10:24,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:10:24,807 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-06 23:10:24,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:10:24,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:10:24,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:10:24,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:10:24,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:10:24,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:10:24,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:10:24,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:10:24,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:10:24,878 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:10:24,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:10:24,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:10:24,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:10:24,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:10:24,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:10:24,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:10:24,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:10:24,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:10:24,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:10:24,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:10:24,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:10:24,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:10:24,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:24,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:10:24,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:10:24,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:10:24,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:10:24,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:10:24,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:10:24,894 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:10:24,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:10:24,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:10:24,895 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:10:24,896 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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2023-11-06 23:10:25,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:10:25,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:10:25,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:10:25,261 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:10:25,262 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:10:25,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2023-11-06 23:10:28,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:10:29,093 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:10:29,094 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2023-11-06 23:10:29,106 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/data/6b7d9d554/60b4d3c08cf346c4b4f687e6e10804e2/FLAG217b083d6 [2023-11-06 23:10:29,123 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/data/6b7d9d554/60b4d3c08cf346c4b4f687e6e10804e2 [2023-11-06 23:10:29,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:10:29,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:10:29,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:29,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:10:29,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:10:29,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbc0662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29, skipping insertion in model container [2023-11-06 23:10:29,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,182 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:10:29,338 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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2023-11-06 23:10:29,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:29,433 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:10:29,445 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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2023-11-06 23:10:29,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:29,513 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:10:29,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29 WrapperNode [2023-11-06 23:10:29,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:29,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:29,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:10:29,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:10:29,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,624 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 412 [2023-11-06 23:10:29,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:29,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:10:29,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:10:29,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:10:29,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:10:29,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:10:29,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:10:29,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:10:29,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (1/1) ... [2023-11-06 23:10:29,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:29,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:29,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:10:29,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:10:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:10:29,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:10:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:10:29,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:10:30,014 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:10:30,017 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:10:30,747 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:10:30,754 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:10:30,755 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:10:30,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:30 BoogieIcfgContainer [2023-11-06 23:10:30,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:10:30,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:10:30,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:10:30,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:10:30,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:10:29" (1/3) ... [2023-11-06 23:10:30,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688ccf8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:30, skipping insertion in model container [2023-11-06 23:10:30,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:29" (2/3) ... [2023-11-06 23:10:30,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688ccf8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:30, skipping insertion in model container [2023-11-06 23:10:30,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:30" (3/3) ... [2023-11-06 23:10:30,768 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2023-11-06 23:10:30,792 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:10:30,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:10:30,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:10:30,879 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;@11434849, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:10:30,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:10:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 70 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 23:10:30,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:30,898 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] [2023-11-06 23:10:30,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:30,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1614125398, now seen corresponding path program 1 times [2023-11-06 23:10:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516495171] [2023-11-06 23:10:30,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:30,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:31,755 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 23:10:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516495171] [2023-11-06 23:10:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516495171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:31,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:31,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:31,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211270131] [2023-11-06 23:10:31,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:31,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:31,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:31,809 INFO L87 Difference]: Start difference. First operand has 71 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 70 states have internal predecessors, (113), 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 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:31,873 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2023-11-06 23:10:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2023-11-06 23:10:31,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:31,888 INFO L225 Difference]: With dead ends: 126 [2023-11-06 23:10:31,888 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 23:10:31,892 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 23:10:31,898 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:31,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 309 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 23:10:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-11-06 23:10:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 68 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 23:10:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 109 transitions. [2023-11-06 23:10:31,944 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 109 transitions. Word has length 39 [2023-11-06 23:10:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:31,945 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 109 transitions. [2023-11-06 23:10:31,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 109 transitions. [2023-11-06 23:10:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:10:31,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:31,948 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] [2023-11-06 23:10:31,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:10:31,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:31,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1503445366, now seen corresponding path program 1 times [2023-11-06 23:10:31,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:31,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512235366] [2023-11-06 23:10:31,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:32,306 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 23:10:32,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512235366] [2023-11-06 23:10:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512235366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:32,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193908008] [2023-11-06 23:10:32,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:32,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:32,315 INFO L87 Difference]: Start difference. First operand 69 states and 109 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:32,391 INFO L93 Difference]: Finished difference Result 127 states and 200 transitions. [2023-11-06 23:10:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:32,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2023-11-06 23:10:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:32,394 INFO L225 Difference]: With dead ends: 127 [2023-11-06 23:10:32,395 INFO L226 Difference]: Without dead ends: 72 [2023-11-06 23:10:32,397 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 23:10:32,399 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:32,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-06 23:10:32,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2023-11-06 23:10:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2023-11-06 23:10:32,423 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 40 [2023-11-06 23:10:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:32,424 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2023-11-06 23:10:32,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2023-11-06 23:10:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-06 23:10:32,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:32,429 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] [2023-11-06 23:10:32,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:10:32,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:32,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:32,438 INFO L85 PathProgramCache]: Analyzing trace with hash -848266172, now seen corresponding path program 1 times [2023-11-06 23:10:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022006749] [2023-11-06 23:10:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:32,816 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 23:10:32,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022006749] [2023-11-06 23:10:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022006749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:32,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896256215] [2023-11-06 23:10:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:32,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:32,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:32,825 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 23:10:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:33,002 INFO L93 Difference]: Finished difference Result 173 states and 269 transitions. [2023-11-06 23:10:33,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:33,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 41 [2023-11-06 23:10:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:33,005 INFO L225 Difference]: With dead ends: 173 [2023-11-06 23:10:33,005 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 23:10:33,006 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 23:10:33,008 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 44 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:33,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 274 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 23:10:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-06 23:10:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 70 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2023-11-06 23:10:33,018 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 41 [2023-11-06 23:10:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:33,018 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2023-11-06 23:10:33,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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 23:10:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2023-11-06 23:10:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 23:10:33,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:33,021 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 23:10:33,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:10:33,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:33,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:33,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2058953114, now seen corresponding path program 1 times [2023-11-06 23:10:33,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:33,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636300091] [2023-11-06 23:10:33,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:33,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:33,783 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 23:10:33,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:33,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636300091] [2023-11-06 23:10:33,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636300091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:33,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:33,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:33,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598191951] [2023-11-06 23:10:33,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:33,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:10:33,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:33,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:10:33,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:33,788 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:34,005 INFO L93 Difference]: Finished difference Result 216 states and 336 transitions. [2023-11-06 23:10:34,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:10:34,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 23:10:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:34,009 INFO L225 Difference]: With dead ends: 216 [2023-11-06 23:10:34,009 INFO L226 Difference]: Without dead ends: 159 [2023-11-06 23:10:34,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:10:34,012 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 456 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:34,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 443 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-06 23:10:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 103. [2023-11-06 23:10:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.5784313725490196) internal successors, (161), 102 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 161 transitions. [2023-11-06 23:10:34,029 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 161 transitions. Word has length 42 [2023-11-06 23:10:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:34,030 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 161 transitions. [2023-11-06 23:10:34,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 161 transitions. [2023-11-06 23:10:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 23:10:34,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:34,033 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, 1] [2023-11-06 23:10:34,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:10:34,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:34,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2098097414, now seen corresponding path program 1 times [2023-11-06 23:10:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504856599] [2023-11-06 23:10:34,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:34,514 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 23:10:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504856599] [2023-11-06 23:10:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504856599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:34,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:34,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:10:34,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251512789] [2023-11-06 23:10:34,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:34,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:10:34,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:34,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:10:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:34,522 INFO L87 Difference]: Start difference. First operand 103 states and 161 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:34,898 INFO L93 Difference]: Finished difference Result 266 states and 413 transitions. [2023-11-06 23:10:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:10:34,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 43 [2023-11-06 23:10:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:34,902 INFO L225 Difference]: With dead ends: 266 [2023-11-06 23:10:34,902 INFO L226 Difference]: Without dead ends: 209 [2023-11-06 23:10:34,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:10:34,905 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 731 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:34,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 730 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-06 23:10:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 106. [2023-11-06 23:10:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 105 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 165 transitions. [2023-11-06 23:10:34,922 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 165 transitions. Word has length 43 [2023-11-06 23:10:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:34,922 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 165 transitions. [2023-11-06 23:10:34,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 165 transitions. [2023-11-06 23:10:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 23:10:34,925 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:34,925 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, 1] [2023-11-06 23:10:34,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:10:34,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:34,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:34,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1803842872, now seen corresponding path program 1 times [2023-11-06 23:10:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:34,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166560182] [2023-11-06 23:10:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:35,761 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 23:10:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166560182] [2023-11-06 23:10:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166560182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:35,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:35,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:10:35,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501626251] [2023-11-06 23:10:35,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:35,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:35,770 INFO L87 Difference]: Start difference. First operand 106 states and 165 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:36,437 INFO L93 Difference]: Finished difference Result 267 states and 415 transitions. [2023-11-06 23:10:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 23:10:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 43 [2023-11-06 23:10:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:36,441 INFO L225 Difference]: With dead ends: 267 [2023-11-06 23:10:36,441 INFO L226 Difference]: Without dead ends: 210 [2023-11-06 23:10:36,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2023-11-06 23:10:36,443 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 611 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:36,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1048 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:10:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-06 23:10:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 109. [2023-11-06 23:10:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 108 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2023-11-06 23:10:36,457 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 43 [2023-11-06 23:10:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:36,458 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2023-11-06 23:10:36,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2023-11-06 23:10:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 23:10:36,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:36,460 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, 1] [2023-11-06 23:10:36,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:10:36,461 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:36,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -716117062, now seen corresponding path program 1 times [2023-11-06 23:10:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:36,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95747406] [2023-11-06 23:10:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:36,928 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 23:10:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95747406] [2023-11-06 23:10:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95747406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:36,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:36,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:10:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977029386] [2023-11-06 23:10:36,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:36,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:10:36,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:10:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:36,932 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:37,042 INFO L93 Difference]: Finished difference Result 283 states and 434 transitions. [2023-11-06 23:10:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:10:37,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 43 [2023-11-06 23:10:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:37,045 INFO L225 Difference]: With dead ends: 283 [2023-11-06 23:10:37,046 INFO L226 Difference]: Without dead ends: 203 [2023-11-06 23:10:37,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:10:37,048 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 324 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:37,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 434 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-06 23:10:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 119. [2023-11-06 23:10:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.5338983050847457) internal successors, (181), 118 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2023-11-06 23:10:37,060 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 43 [2023-11-06 23:10:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:37,061 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2023-11-06 23:10:37,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2023-11-06 23:10:37,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 23:10:37,063 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:37,063 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, 1, 1] [2023-11-06 23:10:37,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:10:37,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:37,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1562747842, now seen corresponding path program 1 times [2023-11-06 23:10:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:37,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337869457] [2023-11-06 23:10:37,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:37,400 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 23:10:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:37,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337869457] [2023-11-06 23:10:37,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337869457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:37,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:37,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571781629] [2023-11-06 23:10:37,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:37,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:37,403 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:37,669 INFO L93 Difference]: Finished difference Result 298 states and 450 transitions. [2023-11-06 23:10:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2023-11-06 23:10:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:37,672 INFO L225 Difference]: With dead ends: 298 [2023-11-06 23:10:37,672 INFO L226 Difference]: Without dead ends: 213 [2023-11-06 23:10:37,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:37,673 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 245 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:37,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 201 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:10:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-06 23:10:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 129. [2023-11-06 23:10:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.5078125) internal successors, (193), 128 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 23:10:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2023-11-06 23:10:37,698 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 44 [2023-11-06 23:10:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:37,699 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2023-11-06 23:10:37,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2023-11-06 23:10:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 23:10:37,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:37,701 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, 1, 1] [2023-11-06 23:10:37,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:10:37,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:37,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash -242690492, now seen corresponding path program 1 times [2023-11-06 23:10:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491998655] [2023-11-06 23:10:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:37,991 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 23:10:37,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491998655] [2023-11-06 23:10:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491998655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:37,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:37,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112035005] [2023-11-06 23:10:37,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:37,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:37,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:37,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:37,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:37,995 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:38,115 INFO L93 Difference]: Finished difference Result 210 states and 313 transitions. [2023-11-06 23:10:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:38,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2023-11-06 23:10:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:38,119 INFO L225 Difference]: With dead ends: 210 [2023-11-06 23:10:38,119 INFO L226 Difference]: Without dead ends: 129 [2023-11-06 23:10:38,120 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 23:10:38,121 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 96 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:38,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 131 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-06 23:10:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-06 23:10:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4921875) internal successors, (191), 128 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2023-11-06 23:10:38,132 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 44 [2023-11-06 23:10:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:38,133 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2023-11-06 23:10:38,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2023-11-06 23:10:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 23:10:38,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:38,135 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, 1, 1, 1] [2023-11-06 23:10:38,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:10:38,136 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:38,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1504564906, now seen corresponding path program 1 times [2023-11-06 23:10:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149898423] [2023-11-06 23:10:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:38,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,478 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 23:10:38,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:38,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149898423] [2023-11-06 23:10:38,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149898423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:38,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:38,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:38,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674052735] [2023-11-06 23:10:38,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:38,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:38,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:38,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:38,483 INFO L87 Difference]: Start difference. First operand 129 states and 191 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 23:10:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:38,522 INFO L93 Difference]: Finished difference Result 207 states and 305 transitions. [2023-11-06 23:10:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:38,523 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 45 [2023-11-06 23:10:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:38,524 INFO L225 Difference]: With dead ends: 207 [2023-11-06 23:10:38,525 INFO L226 Difference]: Without dead ends: 129 [2023-11-06 23:10:38,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 23:10:38,526 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 150 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:38,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 230 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:38,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-06 23:10:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-06 23:10:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4765625) internal successors, (189), 128 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 23:10:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2023-11-06 23:10:38,536 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 45 [2023-11-06 23:10:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:38,537 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2023-11-06 23:10:38,537 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 23:10:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2023-11-06 23:10:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:10:38,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:38,539 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, 1, 1, 1, 1] [2023-11-06 23:10:38,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:10:38,539 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:38,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -657522838, now seen corresponding path program 1 times [2023-11-06 23:10:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:38,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091450314] [2023-11-06 23:10:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:38,766 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 23:10:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091450314] [2023-11-06 23:10:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091450314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:38,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:38,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:38,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075662417] [2023-11-06 23:10:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:38,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:38,770 INFO L87 Difference]: Start difference. First operand 129 states and 189 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 23:10:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:38,867 INFO L93 Difference]: Finished difference Result 290 states and 421 transitions. [2023-11-06 23:10:38,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:10:38,868 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 46 [2023-11-06 23:10:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:38,870 INFO L225 Difference]: With dead ends: 290 [2023-11-06 23:10:38,870 INFO L226 Difference]: Without dead ends: 212 [2023-11-06 23:10:38,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:38,871 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 157 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:38,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 459 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-11-06 23:10:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 135. [2023-11-06 23:10:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.455223880597015) internal successors, (195), 134 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 195 transitions. [2023-11-06 23:10:38,881 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 195 transitions. Word has length 46 [2023-11-06 23:10:38,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:38,881 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 195 transitions. [2023-11-06 23:10:38,881 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 23:10:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 195 transitions. [2023-11-06 23:10:38,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:10:38,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:38,883 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, 1, 1, 1, 1] [2023-11-06 23:10:38,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:10:38,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:38,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:38,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1937386516, now seen corresponding path program 1 times [2023-11-06 23:10:38,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:38,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882906014] [2023-11-06 23:10:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:39,311 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 23:10:39,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:39,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882906014] [2023-11-06 23:10:39,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882906014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:39,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272435253] [2023-11-06 23:10:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:39,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:39,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:39,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:39,315 INFO L87 Difference]: Start difference. First operand 135 states and 195 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 23:10:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:39,498 INFO L93 Difference]: Finished difference Result 227 states and 324 transitions. [2023-11-06 23:10:39,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:39,499 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 46 [2023-11-06 23:10:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:39,500 INFO L225 Difference]: With dead ends: 227 [2023-11-06 23:10:39,501 INFO L226 Difference]: Without dead ends: 143 [2023-11-06 23:10:39,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:39,502 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 83 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:39,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 187 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:10:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-06 23:10:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2023-11-06 23:10:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4357142857142857) internal successors, (201), 140 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 201 transitions. [2023-11-06 23:10:39,513 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 201 transitions. Word has length 46 [2023-11-06 23:10:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:39,513 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 201 transitions. [2023-11-06 23:10:39,514 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 23:10:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 201 transitions. [2023-11-06 23:10:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:10:39,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:39,515 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, 1, 1, 1, 1] [2023-11-06 23:10:39,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:10:39,516 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:39,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1643299752, now seen corresponding path program 1 times [2023-11-06 23:10:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432708174] [2023-11-06 23:10:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:39,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,033 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 23:10:40,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432708174] [2023-11-06 23:10:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432708174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:40,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:40,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:10:40,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335274448] [2023-11-06 23:10:40,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:40,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:40,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:40,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:40,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:40,038 INFO L87 Difference]: Start difference. First operand 141 states and 201 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 23:10:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:40,209 INFO L93 Difference]: Finished difference Result 242 states and 343 transitions. [2023-11-06 23:10:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:40,210 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 46 [2023-11-06 23:10:40,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:40,211 INFO L225 Difference]: With dead ends: 242 [2023-11-06 23:10:40,212 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 23:10:40,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:10:40,213 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 93 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:40,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 187 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 23:10:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2023-11-06 23:10:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 136 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 195 transitions. [2023-11-06 23:10:40,223 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 195 transitions. Word has length 46 [2023-11-06 23:10:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:40,224 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 195 transitions. [2023-11-06 23:10:40,224 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 23:10:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 195 transitions. [2023-11-06 23:10:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:10:40,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:40,225 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, 1, 1, 1, 1] [2023-11-06 23:10:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:10:40,226 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:40,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:40,227 INFO L85 PathProgramCache]: Analyzing trace with hash 993278052, now seen corresponding path program 1 times [2023-11-06 23:10:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956494207] [2023-11-06 23:10:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:40,833 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 23:10:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956494207] [2023-11-06 23:10:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956494207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:10:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584031193] [2023-11-06 23:10:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:40,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:10:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:40,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:10:40,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:40,837 INFO L87 Difference]: Start difference. First operand 137 states and 195 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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 23:10:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:41,124 INFO L93 Difference]: Finished difference Result 339 states and 478 transitions. [2023-11-06 23:10:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:10:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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 46 [2023-11-06 23:10:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:41,127 INFO L225 Difference]: With dead ends: 339 [2023-11-06 23:10:41,127 INFO L226 Difference]: Without dead ends: 242 [2023-11-06 23:10:41,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:10:41,129 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 323 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:41,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 591 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:10:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-06 23:10:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 145. [2023-11-06 23:10:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4236111111111112) internal successors, (205), 144 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2023-11-06 23:10:41,153 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 46 [2023-11-06 23:10:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:41,155 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2023-11-06 23:10:41,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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 23:10:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2023-11-06 23:10:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:10:41,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:41,157 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, 1, 1, 1, 1] [2023-11-06 23:10:41,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:10:41,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:41,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1133826662, now seen corresponding path program 1 times [2023-11-06 23:10:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039157306] [2023-11-06 23:10:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:41,838 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 23:10:41,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:41,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039157306] [2023-11-06 23:10:41,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039157306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:41,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:41,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:10:41,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037692214] [2023-11-06 23:10:41,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:41,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:10:41,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:10:41,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:10:41,842 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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 23:10:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:42,368 INFO L93 Difference]: Finished difference Result 249 states and 350 transitions. [2023-11-06 23:10:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:10:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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 46 [2023-11-06 23:10:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:42,370 INFO L225 Difference]: With dead ends: 249 [2023-11-06 23:10:42,371 INFO L226 Difference]: Without dead ends: 145 [2023-11-06 23:10:42,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:10:42,372 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 232 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:42,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 260 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:10:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-06 23:10:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2023-11-06 23:10:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 132 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 23:10:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2023-11-06 23:10:42,385 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 183 transitions. Word has length 46 [2023-11-06 23:10:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:42,386 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 183 transitions. [2023-11-06 23:10:42,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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 23:10:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2023-11-06 23:10:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 23:10:42,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:42,387 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, 1, 1, 1, 1, 1] [2023-11-06 23:10:42,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:10:42,388 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:42,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2012702344, now seen corresponding path program 1 times [2023-11-06 23:10:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043984508] [2023-11-06 23:10:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:42,719 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 23:10:42,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:42,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043984508] [2023-11-06 23:10:42,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043984508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:42,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:10:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244159330] [2023-11-06 23:10:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:42,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:10:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:10:42,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:10:42,727 INFO L87 Difference]: Start difference. First operand 133 states and 183 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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 23:10:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:42,904 INFO L93 Difference]: Finished difference Result 218 states and 300 transitions. [2023-11-06 23:10:42,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:42,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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 47 [2023-11-06 23:10:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:42,906 INFO L225 Difference]: With dead ends: 218 [2023-11-06 23:10:42,907 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 23:10:42,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:10:42,908 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 161 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:42,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 484 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:10:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 23:10:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2023-11-06 23:10:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.375) internal successors, (187), 136 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2023-11-06 23:10:42,917 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 187 transitions. Word has length 47 [2023-11-06 23:10:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:42,918 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 187 transitions. [2023-11-06 23:10:42,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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 23:10:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 187 transitions. [2023-11-06 23:10:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 23:10:42,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:42,919 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, 1, 1, 1, 1, 1] [2023-11-06 23:10:42,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:10:42,920 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:42,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:42,920 INFO L85 PathProgramCache]: Analyzing trace with hash 732838666, now seen corresponding path program 1 times [2023-11-06 23:10:42,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:42,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095390347] [2023-11-06 23:10:42,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:42,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:43,653 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 23:10:43,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095390347] [2023-11-06 23:10:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095390347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:43,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 23:10:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309684752] [2023-11-06 23:10:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:43,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:10:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:10:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:10:43,657 INFO L87 Difference]: Start difference. First operand 137 states and 187 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 23:10:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:44,311 INFO L93 Difference]: Finished difference Result 216 states and 294 transitions. [2023-11-06 23:10:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:10:44,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 47 [2023-11-06 23:10:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:44,313 INFO L225 Difference]: With dead ends: 216 [2023-11-06 23:10:44,313 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 23:10:44,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:10:44,314 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 233 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:44,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 295 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:10:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 23:10:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2023-11-06 23:10:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.371212121212121) internal successors, (181), 132 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 181 transitions. [2023-11-06 23:10:44,326 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 181 transitions. Word has length 47 [2023-11-06 23:10:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:44,326 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 181 transitions. [2023-11-06 23:10:44,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 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 23:10:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2023-11-06 23:10:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 23:10:44,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:44,331 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:44,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:10:44,332 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:44,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 384529972, now seen corresponding path program 1 times [2023-11-06 23:10:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990041851] [2023-11-06 23:10:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:10:44,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:10:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:10:44,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:10:44,588 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:10:44,589 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:10:44,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:10:44,600 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:44,604 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:10:44,718 WARN L316 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-11-06 23:10:44,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:10:44 BoogieIcfgContainer [2023-11-06 23:10:44,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:10:44,750 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:10:44,750 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:10:44,751 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:10:44,751 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:30" (3/4) ... [2023-11-06 23:10:44,755 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:10:44,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:10:44,758 INFO L158 Benchmark]: Toolchain (without parser) took 15629.35ms. Allocated memory was 144.7MB in the beginning and 270.5MB in the end (delta: 125.8MB). Free memory was 111.5MB in the beginning and 221.4MB in the end (delta: -109.9MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2023-11-06 23:10:44,758 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 113.2MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:10:44,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.82ms. Allocated memory is still 144.7MB. Free memory was 111.1MB in the beginning and 95.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 23:10:44,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.20ms. Allocated memory is still 144.7MB. Free memory was 95.9MB in the beginning and 87.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 23:10:44,760 INFO L158 Benchmark]: Boogie Preprocessor took 141.70ms. Allocated memory is still 144.7MB. Free memory was 87.6MB in the beginning and 84.0MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:44,761 INFO L158 Benchmark]: RCFGBuilder took 990.34ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 84.0MB in the beginning and 148.8MB in the end (delta: -64.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2023-11-06 23:10:44,762 INFO L158 Benchmark]: TraceAbstraction took 13989.09ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 147.8MB in the beginning and 221.4MB in the end (delta: -73.6MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2023-11-06 23:10:44,762 INFO L158 Benchmark]: Witness Printer took 6.53ms. Allocated memory is still 270.5MB. Free memory is still 221.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:10:44,773 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.85ms. Allocated memory is still 113.2MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.82ms. Allocated memory is still 144.7MB. Free memory was 111.1MB in the beginning and 95.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.20ms. Allocated memory is still 144.7MB. Free memory was 95.9MB in the beginning and 87.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.70ms. Allocated memory is still 144.7MB. Free memory was 87.6MB in the beginning and 84.0MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 990.34ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 84.0MB in the beginning and 148.8MB in the end (delta: -64.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13989.09ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 147.8MB in the beginning and 221.4MB in the end (delta: -73.6MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. * Witness Printer took 6.53ms. Allocated memory is still 270.5MB. Free memory is still 221.4MB. 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: 21]: 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 bitwiseOr at line 123, overapproximation of bitwiseAnd at line 128. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_27 mask_SORT_27 = (SORT_27)-1 >> (sizeof(SORT_27) * 8 - 2); [L33] const SORT_27 msb_SORT_27 = (SORT_27)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 2; [L38] const SORT_5 var_24 = 1; [L39] const SORT_1 var_41 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_5 input_6; [L45] SORT_5 input_7; [L46] SORT_1 input_8; [L47] SORT_5 input_9; [L48] SORT_5 input_10; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L50] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [__VERIFIER_nondet_uchar() & mask_SORT_5=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L51] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [__VERIFIER_nondet_uchar() & mask_SORT_1=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L52] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [__VERIFIER_nondet_uchar() & mask_SORT_5=0, __VERIFIER_nondet_uchar()=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L53] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 init_13_arg_1 = var_11; [L56] state_12 = init_13_arg_1 [L57] SORT_5 init_17_arg_1 = var_15; [L58] state_16 = init_17_arg_1 [L59] SORT_1 init_19_arg_1 = var_11; [L60] state_18 = init_19_arg_1 [L61] SORT_5 init_31_arg_1 = var_15; [L62] state_30 = init_31_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2 & mask_SORT_1=0, input_2=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L66] input_2 = input_2 & mask_SORT_1 [L67] input_3 = __VERIFIER_nondet_uchar() [L68] EXPR input_3 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3 & mask_SORT_1=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L68] input_3 = input_3 & mask_SORT_1 [L69] input_4 = __VERIFIER_nondet_uchar() [L70] input_6 = __VERIFIER_nondet_uchar() [L71] input_7 = __VERIFIER_nondet_uchar() [L72] input_8 = __VERIFIER_nondet_uchar() [L73] input_9 = __VERIFIER_nondet_uchar() [L74] input_10 = __VERIFIER_nondet_uchar() [L77] SORT_1 var_14_arg_0 = state_12; [L78] SORT_1 var_14 = ~var_14_arg_0; [L79] SORT_1 var_20_arg_0 = state_18; [L80] SORT_5 var_20_arg_1 = state_16; [L81] SORT_5 var_20_arg_2 = input_7; [L82] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_24=1, var_41=1] [L83] EXPR var_20 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20 & mask_SORT_5=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_24=1, var_41=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_25_arg_0 = var_20; [L85] SORT_5 var_25_arg_1 = var_24; [L86] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L87] SORT_1 var_26_arg_0 = var_25; [L88] SORT_1 var_26 = ~var_26_arg_0; [L89] SORT_5 var_22_arg_0 = var_20; [L90] SORT_5 var_22_arg_1 = var_21; [L91] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L92] SORT_1 var_23_arg_0 = var_22; [L93] SORT_1 var_23 = ~var_23_arg_0; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=255, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_41=1] [L94] EXPR var_23 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23 & mask_SORT_1=0, var_23=255, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_41=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 var_28_arg_0 = var_26; [L96] SORT_1 var_28_arg_1 = var_23; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28_arg_0=255, var_28_arg_1=0, var_41=1] [L97] EXPR ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1 VAL [((SORT_27)var_28_arg_0 << 1) | var_28_arg_1=510, init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28_arg_0=255, var_28_arg_1=0, var_41=1] [L97] SORT_27 var_28 = ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1; [L98] EXPR var_28 & mask_SORT_27 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28 & mask_SORT_27=2, var_28=254, var_28_arg_0=255, var_28_arg_1=0, var_41=1] [L98] var_28 = var_28 & mask_SORT_27 [L99] SORT_27 var_29_arg_0 = var_28; [L100] SORT_1 var_29 = var_29_arg_0 == mask_SORT_27; [L101] SORT_1 var_32_arg_0 = state_18; [L102] SORT_5 var_32_arg_1 = state_30; [L103] SORT_5 var_32_arg_2 = input_7; [L104] SORT_5 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_41=1] [L105] EXPR var_32 & mask_SORT_5 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32 & mask_SORT_5=0, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_41=1] [L105] var_32 = var_32 & mask_SORT_5 [L106] SORT_5 var_33_arg_0 = var_32; [L107] SORT_5 var_33_arg_1 = var_21; [L108] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_1 var_34 = ~var_34_arg_0; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=255, var_34_arg_0=0, var_41=1] [L111] EXPR var_34 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34 & mask_SORT_1=0, var_34=255, var_34_arg_0=0, var_41=1] [L111] var_34 = var_34 & mask_SORT_1 [L112] SORT_1 var_35_arg_0 = var_26; [L113] SORT_1 var_35_arg_1 = var_34; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35_arg_0=255, var_35_arg_1=0, var_41=1] [L114] EXPR ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1 VAL [((SORT_27)var_35_arg_0 << 1) | var_35_arg_1=510, init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35_arg_0=255, var_35_arg_1=0, var_41=1] [L114] SORT_27 var_35 = ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1; [L115] EXPR var_35 & mask_SORT_27 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35 & mask_SORT_27=0, var_35=254, var_35_arg_0=255, var_35_arg_1=0, var_41=1] [L115] var_35 = var_35 & mask_SORT_27 [L116] SORT_27 var_36_arg_0 = var_35; [L117] SORT_1 var_36 = var_36_arg_0 == mask_SORT_27; [L118] SORT_1 var_37_arg_0 = var_29; [L119] SORT_1 var_37_arg_1 = var_36; [L120] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L121] SORT_1 var_38_arg_0 = var_14; [L122] SORT_1 var_38_arg_1 = var_37; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=0, var_35_arg_0=255, var_35_arg_1=0, var_36=0, var_36_arg_0=0, var_37=1, var_37_arg_0=0, var_37_arg_1=0, var_38_arg_0=255, var_38_arg_1=1, var_41=1] [L123] EXPR var_38_arg_0 | var_38_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=0, var_35_arg_0=255, var_35_arg_1=0, var_36=0, var_36_arg_0=0, var_37=1, var_37_arg_0=0, var_37_arg_1=0, var_38_arg_0 | var_38_arg_1=256, var_38_arg_0=255, var_38_arg_1=1, var_41=1] [L123] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L124] SORT_1 var_42_arg_0 = var_38; [L125] SORT_1 var_42 = ~var_42_arg_0; [L126] SORT_1 var_43_arg_0 = var_41; [L127] SORT_1 var_43_arg_1 = var_42; VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=0, var_35_arg_0=255, var_35_arg_1=0, var_36=0, var_36_arg_0=0, var_37=1, var_37_arg_0=0, var_37_arg_1=0, var_38=0, var_38_arg_0=255, var_38_arg_1=1, var_41=1, var_42=255, var_42_arg_0=0, var_43_arg_0=1, var_43_arg_1=255] [L128] EXPR var_43_arg_0 & var_43_arg_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=0, var_35_arg_0=255, var_35_arg_1=0, var_36=0, var_36_arg_0=0, var_37=1, var_37_arg_0=0, var_37_arg_1=0, var_38=0, var_38_arg_0=255, var_38_arg_1=1, var_41=1, var_42=255, var_42_arg_0=0, var_43_arg_0 & var_43_arg_1=1, var_43_arg_0=1, var_43_arg_1=255] [L128] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L129] EXPR var_43 & mask_SORT_1 VAL [init_13_arg_1=0, init_17_arg_1=0, init_19_arg_1=0, init_31_arg_1=0, input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, msb_SORT_1=1, msb_SORT_27=2, msb_SORT_5=4, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_14=255, var_14_arg_0=0, var_15=0, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_20_arg_2=0, var_21=2, var_22=0, var_22_arg_0=0, var_22_arg_1=2, var_23=0, var_23_arg_0=0, var_24=1, var_25=0, var_25_arg_0=0, var_25_arg_1=1, var_26=255, var_26_arg_0=0, var_28=2, var_28_arg_0=255, var_28_arg_1=0, var_29=0, var_29_arg_0=2, var_32=0, var_32_arg_0=0, var_32_arg_1=0, var_32_arg_2=0, var_33=0, var_33_arg_0=0, var_33_arg_1=2, var_34=0, var_34_arg_0=0, var_35=0, var_35_arg_0=255, var_35_arg_1=0, var_36=0, var_36_arg_0=0, var_37=1, var_37_arg_0=0, var_37_arg_1=0, var_38=0, var_38_arg_0=255, var_38_arg_1=1, var_41=1, var_42=255, var_42_arg_0=0, var_43 & mask_SORT_1=1, var_43=1, var_43_arg_0=1, var_43_arg_1=255] [L129] var_43 = var_43 & mask_SORT_1 [L130] SORT_1 bad_44_arg_0 = var_43; [L131] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3941 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3941 mSDsluCounter, 6569 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4739 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1635 IncrementalHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1830 mSDtfsCounter, 1635 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=14, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 625 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 796 NumberOfCodeBlocks, 796 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 3512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 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 23:10:44,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 64bit --witnessprinter.graph.data.programhash 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:10:47,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:10:48,086 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-06 23:10:48,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:10:48,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:10:48,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:10:48,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:10:48,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:10:48,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:10:48,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:10:48,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:10:48,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:10:48,129 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:10:48,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:10:48,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:10:48,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:10:48,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:10:48,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:10:48,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:10:48,139 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:10:48,144 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:10:48,144 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:10:48,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:10:48,147 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:10:48,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:10:48,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:10:48,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:10:48,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:48,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:10:48,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:10:48,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:10:48,152 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:10:48,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:10:48,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:10:48,154 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:10:48,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:10:48,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:10:48,154 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:10:48,155 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:10:48,156 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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2023-11-06 23:10:48,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:10:48,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:10:48,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:10:48,722 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:10:48,723 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:10:48,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2023-11-06 23:10:52,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:10:52,475 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:10:52,475 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2023-11-06 23:10:52,487 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/data/441994993/6ca75e2a4f714714b873c9c33eab8787/FLAG3c4f8cf31 [2023-11-06 23:10:52,505 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/data/441994993/6ca75e2a4f714714b873c9c33eab8787 [2023-11-06 23:10:52,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:10:52,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:10:52,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:52,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:10:52,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:10:52,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:52" (1/1) ... [2023-11-06 23:10:52,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145600e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:52, skipping insertion in model container [2023-11-06 23:10:52,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:10:52" (1/1) ... [2023-11-06 23:10:52,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:10:52,848 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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2023-11-06 23:10:52,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:52,964 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:10:53,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_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2023-11-06 23:10:53,084 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:10:53,103 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:10:53,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53 WrapperNode [2023-11-06 23:10:53,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:10:53,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:53,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:10:53,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:10:53,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,178 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 212 [2023-11-06 23:10:53,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:10:53,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:10:53,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:10:53,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:10:53,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:10:53,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:10:53,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:10:53,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:10:53,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (1/1) ... [2023-11-06 23:10:53,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:10:53,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:10:53,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:10:53,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:10:53,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:10:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:10:53,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:10:53,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:10:53,566 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:10:53,571 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:10:54,132 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:10:54,139 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:10:54,140 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:10:54,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:54 BoogieIcfgContainer [2023-11-06 23:10:54,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:10:54,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:10:54,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:10:54,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:10:54,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:10:52" (1/3) ... [2023-11-06 23:10:54,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df129ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:54, skipping insertion in model container [2023-11-06 23:10:54,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:10:53" (2/3) ... [2023-11-06 23:10:54,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df129ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:10:54, skipping insertion in model container [2023-11-06 23:10:54,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:10:54" (3/3) ... [2023-11-06 23:10:54,160 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2023-11-06 23:10:54,184 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:10:54,184 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:10:54,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:10:54,270 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;@163fb079, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:10:54,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:10:54,277 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 23:10:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 23:10:54,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:54,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:10:54,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:54,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2023-11-06 23:10:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:10:54,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381667987] [2023-11-06 23:10:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:54,329 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 23:10:54,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:10:54,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:10:54,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:10:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:54,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 23:10:54,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:10:54,885 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 23:10:54,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:10:54,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:10:54,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381667987] [2023-11-06 23:10:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381667987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:54,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:10:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401424698] [2023-11-06 23:10:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:54,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:10:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:54,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:54,956 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:55,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:10:55,033 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2023-11-06 23:10:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:10:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2023-11-06 23:10:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:10:55,044 INFO L225 Difference]: With dead ends: 19 [2023-11-06 23:10:55,045 INFO L226 Difference]: Without dead ends: 10 [2023-11-06 23:10:55,048 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 23:10:55,053 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:10:55,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:10:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-06 23:10:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2023-11-06 23:10:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-06 23:10:55,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2023-11-06 23:10:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:10:55,094 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-06 23:10:55,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:10:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-06 23:10:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 23:10:55,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:10:55,096 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:55,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:10:55,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:10:55,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:10:55,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2023-11-06 23:10:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:10:55,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497360336] [2023-11-06 23:10:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:55,316 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 23:10:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:10:55,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:10:55,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:10:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:55,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-06 23:10:55,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:10:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:56,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:11:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:00,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:11:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497360336] [2023-11-06 23:11:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497360336] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:11:00,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:11:00,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-06 23:11:00,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619962485] [2023-11-06 23:11:00,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 23:11:00,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:11:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:11:00,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:11:00,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:11:00,643 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:11:00,818 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2023-11-06 23:11:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:11:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2023-11-06 23:11:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:11:00,820 INFO L225 Difference]: With dead ends: 15 [2023-11-06 23:11:00,820 INFO L226 Difference]: Without dead ends: 13 [2023-11-06 23:11:00,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:11:00,823 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 17 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.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:11:00,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 17 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:11:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-06 23:11:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2023-11-06 23:11:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-11-06 23:11:00,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2023-11-06 23:11:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:11:00,829 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-11-06 23:11:00,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:11:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-11-06 23:11:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 23:11:00,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:11:00,831 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-06 23:11:00,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:11:01,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:11:01,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:11:01,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:11:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1020920393, now seen corresponding path program 2 times [2023-11-06 23:11:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:11:01,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137129386] [2023-11-06 23:11:01,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:11:01,051 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 23:11:01,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:11:01,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:11:01,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b95df1a-d9b5-491a-878b-89eb68cdbb5c/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 23:11:01,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:11:01,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:11:01,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-06 23:11:01,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:11:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:11:04,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:11:48,629 WARN L293 SmtUtils]: Spent 7.14s on a formula simplification that was a NOOP. DAG size: 429 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 23:13:46,063 WARN L293 SmtUtils]: Spent 12.15s on a formula simplification that was a NOOP. DAG size: 527 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)