./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d798965d86660c5110959c1d057cdab017d50d3759f8bb695ae6218245b649d7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 09:17:35,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 09:17:35,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 09:17:35,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 09:17:35,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 09:17:35,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 09:17:35,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 09:17:35,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 09:17:35,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 09:17:35,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 09:17:35,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 09:17:35,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 09:17:35,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 09:17:35,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 09:17:35,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 09:17:35,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 09:17:35,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 09:17:35,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 09:17:35,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 09:17:35,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 09:17:35,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 09:17:35,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 09:17:35,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 09:17:35,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 09:17:35,938 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 09:17:35,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 09:17:35,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 09:17:35,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 09:17:35,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 09:17:35,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 09:17:35,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 09:17:35,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 09:17:35,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:17:35,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 09:17:35,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 09:17:35,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 09:17:35,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 09:17:35,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 09:17:35,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 09:17:35,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 09:17:35,944 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 09:17:35,944 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 09:17:35,944 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d798965d86660c5110959c1d057cdab017d50d3759f8bb695ae6218245b649d7 [2024-11-22 09:17:36,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 09:17:36,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 09:17:36,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 09:17:36,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 09:17:36,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 09:17:36,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i [2024-11-22 09:17:37,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 09:17:37,897 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 09:17:37,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i [2024-11-22 09:17:37,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17bba661e/52464cf3f4a64bd5aaa4675e078439c6/FLAG35161ee80 [2024-11-22 09:17:37,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17bba661e/52464cf3f4a64bd5aaa4675e078439c6 [2024-11-22 09:17:37,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 09:17:37,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 09:17:37,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 09:17:37,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 09:17:37,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 09:17:37,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:17:37" (1/1) ... [2024-11-22 09:17:37,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f16ed26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:37, skipping insertion in model container [2024-11-22 09:17:37,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:17:37" (1/1) ... [2024-11-22 09:17:37,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 09:17:38,093 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i[918,931] [2024-11-22 09:17:38,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:17:38,180 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 09:17:38,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i[918,931] [2024-11-22 09:17:38,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:17:38,229 INFO L204 MainTranslator]: Completed translation [2024-11-22 09:17:38,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38 WrapperNode [2024-11-22 09:17:38,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 09:17:38,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 09:17:38,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 09:17:38,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 09:17:38,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,271 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-11-22 09:17:38,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 09:17:38,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 09:17:38,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 09:17:38,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 09:17:38,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 09:17:38,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 09:17:38,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 09:17:38,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 09:17:38,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 09:17:38,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (1/1) ... [2024-11-22 09:17:38,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:17:38,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:17:38,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 09:17:38,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 09:17:38,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 09:17:38,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 09:17:38,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 09:17:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 09:17:38,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 09:17:38,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 09:17:38,534 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 09:17:38,536 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 09:17:38,927 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-22 09:17:38,930 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 09:17:38,947 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 09:17:38,947 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 09:17:38,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:17:38 BoogieIcfgContainer [2024-11-22 09:17:38,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 09:17:38,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 09:17:38,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 09:17:38,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 09:17:38,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:17:37" (1/3) ... [2024-11-22 09:17:38,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f8a0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:17:38, skipping insertion in model container [2024-11-22 09:17:38,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:38" (2/3) ... [2024-11-22 09:17:38,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f8a0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:17:38, skipping insertion in model container [2024-11-22 09:17:38,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:17:38" (3/3) ... [2024-11-22 09:17:38,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i [2024-11-22 09:17:38,980 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 09:17:38,980 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 09:17:39,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 09:17:39,033 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@bdbdf0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 09:17:39,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 09:17:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 09:17:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 09:17:39,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:17:39,048 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:17:39,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:17:39,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:17:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1353844607, now seen corresponding path program 1 times [2024-11-22 09:17:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:17:39,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599440071] [2024-11-22 09:17:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:17:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-22 09:17:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:17:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599440071] [2024-11-22 09:17:39,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599440071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:17:39,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479467210] [2024-11-22 09:17:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:39,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:17:39,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:17:39,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:17:39,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 09:17:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:39,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 09:17:39,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:17:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-11-22 09:17:39,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:17:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479467210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:17:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 09:17:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 09:17:39,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507638741] [2024-11-22 09:17:39,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:17:39,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 09:17:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:17:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 09:17:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 09:17:39,558 INFO L87 Difference]: Start difference. First operand has 97 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 09:17:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:17:39,583 INFO L93 Difference]: Finished difference Result 187 states and 315 transitions. [2024-11-22 09:17:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 09:17:39,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2024-11-22 09:17:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:17:39,591 INFO L225 Difference]: With dead ends: 187 [2024-11-22 09:17:39,592 INFO L226 Difference]: Without dead ends: 93 [2024-11-22 09:17:39,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 09:17:39,597 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:17:39,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:17:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-22 09:17:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-22 09:17:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 09:17:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2024-11-22 09:17:39,632 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 137 [2024-11-22 09:17:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:17:39,656 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2024-11-22 09:17:39,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 09:17:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2024-11-22 09:17:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 09:17:39,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:17:39,664 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:17:39,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 09:17:39,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 09:17:39,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:17:39,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:17:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash -754589945, now seen corresponding path program 1 times [2024-11-22 09:17:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:17:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678760988] [2024-11-22 09:17:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:39,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:17:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:17:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:17:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678760988] [2024-11-22 09:17:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678760988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:17:40,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:17:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:17:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890018859] [2024-11-22 09:17:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:17:40,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:17:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:17:40,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:17:40,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:17:40,143 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:17:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:17:40,215 INFO L93 Difference]: Finished difference Result 260 states and 400 transitions. [2024-11-22 09:17:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:17:40,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-22 09:17:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:17:40,221 INFO L225 Difference]: With dead ends: 260 [2024-11-22 09:17:40,221 INFO L226 Difference]: Without dead ends: 170 [2024-11-22 09:17:40,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:17:40,224 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 114 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:17:40,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 308 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:17:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-22 09:17:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-11-22 09:17:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.4393939393939394) internal successors, (190), 133 states have internal predecessors, (190), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 09:17:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 254 transitions. [2024-11-22 09:17:40,247 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 254 transitions. Word has length 137 [2024-11-22 09:17:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:17:40,248 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 254 transitions. [2024-11-22 09:17:40,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:17:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 254 transitions. [2024-11-22 09:17:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 09:17:40,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:17:40,254 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:17:40,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 09:17:40,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:17:40,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:17:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1168638089, now seen corresponding path program 1 times [2024-11-22 09:17:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:17:40,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256315098] [2024-11-22 09:17:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:17:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:17:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:17:40,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256315098] [2024-11-22 09:17:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256315098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:17:40,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:17:40,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:17:40,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651175602] [2024-11-22 09:17:40,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:17:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:17:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:17:40,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:17:40,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:17:40,427 INFO L87 Difference]: Start difference. First operand 167 states and 254 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:17:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:17:40,441 INFO L93 Difference]: Finished difference Result 333 states and 509 transitions. [2024-11-22 09:17:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:17:40,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-22 09:17:40,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:17:40,444 INFO L225 Difference]: With dead ends: 333 [2024-11-22 09:17:40,444 INFO L226 Difference]: Without dead ends: 169 [2024-11-22 09:17:40,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:17:40,450 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:17:40,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:17:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-22 09:17:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-22 09:17:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 135 states have internal predecessors, (192), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 09:17:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2024-11-22 09:17:40,473 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 137 [2024-11-22 09:17:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:17:40,474 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2024-11-22 09:17:40,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:17:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2024-11-22 09:17:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 09:17:40,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:17:40,480 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:17:40,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 09:17:40,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:17:40,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:17:40,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1930907027, now seen corresponding path program 1 times [2024-11-22 09:17:40,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:17:40,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002502634] [2024-11-22 09:17:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:40,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:17:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:17:42,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:17:42,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002502634] [2024-11-22 09:17:42,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002502634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:17:42,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727989241] [2024-11-22 09:17:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:42,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:17:42,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:17:42,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:17:42,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 09:17:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:42,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 09:17:42,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:17:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-22 09:17:43,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 09:17:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:17:43,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727989241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 09:17:43,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 09:17:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2024-11-22 09:17:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368796726] [2024-11-22 09:17:43,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 09:17:43,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 09:17:43,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:17:43,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 09:17:43,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-22 09:17:43,478 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2024-11-22 09:17:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:17:45,682 INFO L93 Difference]: Finished difference Result 654 states and 949 transitions. [2024-11-22 09:17:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 09:17:45,683 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) Word has length 138 [2024-11-22 09:17:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:17:45,685 INFO L225 Difference]: With dead ends: 654 [2024-11-22 09:17:45,687 INFO L226 Difference]: Without dead ends: 488 [2024-11-22 09:17:45,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=395, Invalid=1327, Unknown=0, NotChecked=0, Total=1722 [2024-11-22 09:17:45,690 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 1436 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 09:17:45,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 542 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 09:17:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-22 09:17:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 382. [2024-11-22 09:17:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 315 states have (on average 1.3904761904761904) internal successors, (438), 318 states have internal predecessors, (438), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 09:17:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 546 transitions. [2024-11-22 09:17:45,728 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 546 transitions. Word has length 138 [2024-11-22 09:17:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:17:45,728 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 546 transitions. [2024-11-22 09:17:45,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 7 states have call successors, (56), 3 states have call predecessors, (56), 5 states have return successors, (57), 6 states have call predecessors, (57), 7 states have call successors, (57) [2024-11-22 09:17:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 546 transitions. [2024-11-22 09:17:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 09:17:45,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:17:45,745 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:17:45,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 09:17:45,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-22 09:17:45,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:17:45,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:17:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash -779105069, now seen corresponding path program 1 times [2024-11-22 09:17:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:17:45,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478135064] [2024-11-22 09:17:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:45,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:17:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:17:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:17:48,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478135064] [2024-11-22 09:17:48,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478135064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:17:48,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858139226] [2024-11-22 09:17:48,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:48,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:17:48,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:17:48,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:17:48,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 09:17:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:48,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 09:17:48,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:17:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 309 proven. 150 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-22 09:17:49,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 09:17:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:17:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858139226] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 09:17:51,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 09:17:51,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 20] total 34 [2024-11-22 09:17:51,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526973576] [2024-11-22 09:17:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:17:51,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 09:17:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:17:51,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 09:17:51,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 09:17:51,415 INFO L87 Difference]: Start difference. First operand 382 states and 546 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:17:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:17:53,856 INFO L93 Difference]: Finished difference Result 1314 states and 1869 transitions. [2024-11-22 09:17:53,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 09:17:53,857 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-22 09:17:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:17:53,861 INFO L225 Difference]: With dead ends: 1314 [2024-11-22 09:17:53,861 INFO L226 Difference]: Without dead ends: 935 [2024-11-22 09:17:53,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2024-11-22 09:17:53,863 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 223 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:17:53,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 695 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 09:17:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-11-22 09:17:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 430. [2024-11-22 09:17:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 363 states have (on average 1.4022038567493114) internal successors, (509), 366 states have internal predecessors, (509), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 09:17:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 617 transitions. [2024-11-22 09:17:53,881 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 617 transitions. Word has length 138 [2024-11-22 09:17:53,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:17:53,882 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 617 transitions. [2024-11-22 09:17:53,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:17:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 617 transitions. [2024-11-22 09:17:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 09:17:53,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:17:53,884 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:17:53,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 09:17:54,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:17:54,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:17:54,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:17:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1128156502, now seen corresponding path program 1 times [2024-11-22 09:17:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:17:54,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983917426] [2024-11-22 09:17:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:17:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:17:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:17:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983917426] [2024-11-22 09:17:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983917426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:17:55,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132884573] [2024-11-22 09:17:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:17:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:17:55,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:17:55,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 09:17:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:55,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 09:17:55,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:17:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:17:55,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:17:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132884573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:17:55,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 09:17:55,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2024-11-22 09:17:55,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257466063] [2024-11-22 09:17:55,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:17:55,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 09:17:55,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:17:55,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 09:17:55,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-22 09:17:55,576 INFO L87 Difference]: Start difference. First operand 430 states and 617 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:17:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:17:55,933 INFO L93 Difference]: Finished difference Result 1195 states and 1691 transitions. [2024-11-22 09:17:55,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 09:17:55,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-22 09:17:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:17:55,937 INFO L225 Difference]: With dead ends: 1195 [2024-11-22 09:17:55,937 INFO L226 Difference]: Without dead ends: 768 [2024-11-22 09:17:55,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-22 09:17:55,939 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 107 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 09:17:55,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 671 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 09:17:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-22 09:17:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 432. [2024-11-22 09:17:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 365 states have (on average 1.4) internal successors, (511), 368 states have internal predecessors, (511), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 09:17:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 619 transitions. [2024-11-22 09:17:55,964 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 619 transitions. Word has length 138 [2024-11-22 09:17:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:17:55,964 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 619 transitions. [2024-11-22 09:17:55,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:17:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 619 transitions. [2024-11-22 09:17:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 09:17:55,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:17:55,966 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:17:55,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 09:17:56,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:17:56,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:17:56,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:17:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1332540499, now seen corresponding path program 1 times [2024-11-22 09:17:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:17:56,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539692477] [2024-11-22 09:17:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:17:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:17:57,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:17:57,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539692477] [2024-11-22 09:17:57,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539692477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:17:57,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058695541] [2024-11-22 09:17:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:17:57,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:17:57,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:17:57,157 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:17:57,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 09:17:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:17:57,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 09:17:57,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:17:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-22 09:17:58,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 09:17:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:17:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058695541] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 09:17:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 09:17:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 16] total 31 [2024-11-22 09:17:59,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175976362] [2024-11-22 09:17:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:17:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 09:17:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:17:59,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 09:17:59,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2024-11-22 09:17:59,517 INFO L87 Difference]: Start difference. First operand 432 states and 619 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:00,903 INFO L93 Difference]: Finished difference Result 1705 states and 2446 transitions. [2024-11-22 09:18:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 09:18:00,903 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-22 09:18:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:00,907 INFO L225 Difference]: With dead ends: 1705 [2024-11-22 09:18:00,908 INFO L226 Difference]: Without dead ends: 1276 [2024-11-22 09:18:00,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 09:18:00,909 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 327 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:00,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 929 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 09:18:00,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-22 09:18:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 453. [2024-11-22 09:18:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 386 states have (on average 1.4170984455958548) internal successors, (547), 389 states have internal predecessors, (547), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 09:18:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 655 transitions. [2024-11-22 09:18:00,931 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 655 transitions. Word has length 138 [2024-11-22 09:18:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:00,931 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 655 transitions. [2024-11-22 09:18:00,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 655 transitions. [2024-11-22 09:18:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 09:18:00,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:00,934 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:00,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 09:18:01,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:01,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:01,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash 983489066, now seen corresponding path program 1 times [2024-11-22 09:18:01,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:01,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327817146] [2024-11-22 09:18:01,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:18:01,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:01,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327817146] [2024-11-22 09:18:01,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327817146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:18:01,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448444799] [2024-11-22 09:18:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:01,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:01,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:18:01,925 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:18:01,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 09:18:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:02,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 09:18:02,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:18:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:02,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:18:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448444799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 09:18:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2024-11-22 09:18:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699154849] [2024-11-22 09:18:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:02,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 09:18:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 09:18:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-22 09:18:02,630 INFO L87 Difference]: Start difference. First operand 453 states and 655 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:03,118 INFO L93 Difference]: Finished difference Result 1266 states and 1809 transitions. [2024-11-22 09:18:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 09:18:03,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-22 09:18:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:03,130 INFO L225 Difference]: With dead ends: 1266 [2024-11-22 09:18:03,130 INFO L226 Difference]: Without dead ends: 816 [2024-11-22 09:18:03,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-22 09:18:03,134 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 284 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:03,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 730 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 09:18:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-22 09:18:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 526. [2024-11-22 09:18:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 459 states have (on average 1.4291938997821352) internal successors, (656), 462 states have internal predecessors, (656), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-22 09:18:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 764 transitions. [2024-11-22 09:18:03,172 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 764 transitions. Word has length 138 [2024-11-22 09:18:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:03,172 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 764 transitions. [2024-11-22 09:18:03,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 764 transitions. [2024-11-22 09:18:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 09:18:03,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:03,174 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:03,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 09:18:03,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:03,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:03,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash -356403243, now seen corresponding path program 1 times [2024-11-22 09:18:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:03,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460585048] [2024-11-22 09:18:03,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:03,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:18:04,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:04,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460585048] [2024-11-22 09:18:04,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460585048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:18:04,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611746030] [2024-11-22 09:18:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:04,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:04,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:18:04,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:18:04,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 09:18:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:04,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 09:18:04,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:18:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 332 proven. 66 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-22 09:18:05,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 09:18:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 69 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-22 09:18:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611746030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 09:18:05,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 09:18:05,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2024-11-22 09:18:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522608987] [2024-11-22 09:18:05,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 09:18:05,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 09:18:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:05,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 09:18:05,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-11-22 09:18:05,580 INFO L87 Difference]: Start difference. First operand 526 states and 764 transitions. Second operand has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) [2024-11-22 09:18:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:10,351 INFO L93 Difference]: Finished difference Result 3194 states and 4619 transitions. [2024-11-22 09:18:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-22 09:18:10,352 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) Word has length 138 [2024-11-22 09:18:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:10,372 INFO L225 Difference]: With dead ends: 3194 [2024-11-22 09:18:10,373 INFO L226 Difference]: Without dead ends: 2671 [2024-11-22 09:18:10,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=787, Invalid=3905, Unknown=0, NotChecked=0, Total=4692 [2024-11-22 09:18:10,382 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1120 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:10,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 2305 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-22 09:18:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2024-11-22 09:18:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 1051. [2024-11-22 09:18:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 910 states have (on average 1.3934065934065933) internal successors, (1268), 916 states have internal predecessors, (1268), 108 states have call successors, (108), 32 states have call predecessors, (108), 32 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-22 09:18:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1484 transitions. [2024-11-22 09:18:10,503 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1484 transitions. Word has length 138 [2024-11-22 09:18:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:10,504 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1484 transitions. [2024-11-22 09:18:10,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) [2024-11-22 09:18:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1484 transitions. [2024-11-22 09:18:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 09:18:10,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:10,509 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:10,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 09:18:10,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:10,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:10,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1919116581, now seen corresponding path program 1 times [2024-11-22 09:18:10,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:10,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848492246] [2024-11-22 09:18:10,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848492246] [2024-11-22 09:18:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848492246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:10,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 09:18:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813540374] [2024-11-22 09:18:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:10,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 09:18:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 09:18:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 09:18:10,920 INFO L87 Difference]: Start difference. First operand 1051 states and 1484 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:11,167 INFO L93 Difference]: Finished difference Result 2260 states and 3191 transitions. [2024-11-22 09:18:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 09:18:11,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-22 09:18:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:11,172 INFO L225 Difference]: With dead ends: 2260 [2024-11-22 09:18:11,172 INFO L226 Difference]: Without dead ends: 1212 [2024-11-22 09:18:11,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 09:18:11,175 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 103 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:11,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 356 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 09:18:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-22 09:18:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1144. [2024-11-22 09:18:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 977 states have (on average 1.3858751279426818) internal successors, (1354), 983 states have internal predecessors, (1354), 127 states have call successors, (127), 39 states have call predecessors, (127), 39 states have return successors, (127), 121 states have call predecessors, (127), 127 states have call successors, (127) [2024-11-22 09:18:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1608 transitions. [2024-11-22 09:18:11,230 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1608 transitions. Word has length 139 [2024-11-22 09:18:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:11,230 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1608 transitions. [2024-11-22 09:18:11,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1608 transitions. [2024-11-22 09:18:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 09:18:11,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:11,234 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:11,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 09:18:11,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:11,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash -696639746, now seen corresponding path program 1 times [2024-11-22 09:18:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684399801] [2024-11-22 09:18:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:18:12,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684399801] [2024-11-22 09:18:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684399801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:18:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025192881] [2024-11-22 09:18:12,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:12,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:12,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:18:12,007 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:18:12,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 09:18:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:12,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 09:18:12,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:18:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-22 09:18:12,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 09:18:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 30 proven. 75 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-22 09:18:12,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025192881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 09:18:12,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 09:18:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 25 [2024-11-22 09:18:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159119111] [2024-11-22 09:18:12,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 09:18:12,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 09:18:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 09:18:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2024-11-22 09:18:12,831 INFO L87 Difference]: Start difference. First operand 1144 states and 1608 transitions. Second operand has 25 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) [2024-11-22 09:18:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:15,600 INFO L93 Difference]: Finished difference Result 5469 states and 7528 transitions. [2024-11-22 09:18:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-22 09:18:15,601 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) Word has length 140 [2024-11-22 09:18:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:15,614 INFO L225 Difference]: With dead ends: 5469 [2024-11-22 09:18:15,614 INFO L226 Difference]: Without dead ends: 4408 [2024-11-22 09:18:15,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1153, Invalid=7037, Unknown=0, NotChecked=0, Total=8190 [2024-11-22 09:18:15,618 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1889 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1976 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1906 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:15,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1906 Valid, 1364 Invalid, 2189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1976 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 09:18:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2024-11-22 09:18:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 1751. [2024-11-22 09:18:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1431 states have (on average 1.3417190775681342) internal successors, (1920), 1443 states have internal predecessors, (1920), 235 states have call successors, (235), 84 states have call predecessors, (235), 84 states have return successors, (235), 223 states have call predecessors, (235), 235 states have call successors, (235) [2024-11-22 09:18:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2390 transitions. [2024-11-22 09:18:15,741 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2390 transitions. Word has length 140 [2024-11-22 09:18:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:15,742 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2390 transitions. [2024-11-22 09:18:15,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.583333333333333) internal successors, (134), 23 states have internal predecessors, (134), 7 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (57), 7 states have call predecessors, (57), 7 states have call successors, (57) [2024-11-22 09:18:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2390 transitions. [2024-11-22 09:18:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 09:18:15,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:15,745 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:15,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-22 09:18:15,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-22 09:18:15,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash -404134635, now seen corresponding path program 1 times [2024-11-22 09:18:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:15,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164861411] [2024-11-22 09:18:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:18:16,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164861411] [2024-11-22 09:18:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164861411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 09:18:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909195202] [2024-11-22 09:18:16,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:16,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:16,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:18:16,912 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:18:16,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 09:18:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:17,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 09:18:17,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:18:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:17,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:18:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909195202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 09:18:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 17 [2024-11-22 09:18:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464632997] [2024-11-22 09:18:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 09:18:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:17,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 09:18:17,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-22 09:18:17,546 INFO L87 Difference]: Start difference. First operand 1751 states and 2390 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:18,131 INFO L93 Difference]: Finished difference Result 3931 states and 5372 transitions. [2024-11-22 09:18:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 09:18:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-22 09:18:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:18,139 INFO L225 Difference]: With dead ends: 3931 [2024-11-22 09:18:18,140 INFO L226 Difference]: Without dead ends: 2277 [2024-11-22 09:18:18,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-22 09:18:18,144 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 135 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:18,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 831 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 09:18:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2024-11-22 09:18:18,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 1623. [2024-11-22 09:18:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1303 states have (on average 1.318495778971604) internal successors, (1718), 1315 states have internal predecessors, (1718), 235 states have call successors, (235), 84 states have call predecessors, (235), 84 states have return successors, (235), 223 states have call predecessors, (235), 235 states have call successors, (235) [2024-11-22 09:18:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2188 transitions. [2024-11-22 09:18:18,252 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2188 transitions. Word has length 140 [2024-11-22 09:18:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:18,252 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2188 transitions. [2024-11-22 09:18:18,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2188 transitions. [2024-11-22 09:18:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 09:18:18,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:18,254 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:18,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-22 09:18:18,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:18,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:18,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1928152588, now seen corresponding path program 1 times [2024-11-22 09:18:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945126665] [2024-11-22 09:18:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 09:18:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316925561] [2024-11-22 09:18:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:18,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:18,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:18:18,574 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:18:18,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 09:18:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:18,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 09:18:18,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:18:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 250 proven. 42 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-22 09:18:18,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 09:18:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:18:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945126665] [2024-11-22 09:18:19,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 09:18:19,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316925561] [2024-11-22 09:18:19,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316925561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 09:18:19,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 09:18:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 09:18:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011989173] [2024-11-22 09:18:19,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 09:18:19,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 09:18:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:19,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 09:18:19,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-22 09:18:19,081 INFO L87 Difference]: Start difference. First operand 1623 states and 2188 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-22 09:18:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:19,722 INFO L93 Difference]: Finished difference Result 3555 states and 4722 transitions. [2024-11-22 09:18:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 09:18:19,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 140 [2024-11-22 09:18:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:19,729 INFO L225 Difference]: With dead ends: 3555 [2024-11-22 09:18:19,729 INFO L226 Difference]: Without dead ends: 2029 [2024-11-22 09:18:19,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-22 09:18:19,733 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 271 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:19,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 778 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 09:18:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2024-11-22 09:18:19,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1755. [2024-11-22 09:18:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1418 states have (on average 1.2983074753173485) internal successors, (1841), 1430 states have internal predecessors, (1841), 235 states have call successors, (235), 101 states have call predecessors, (235), 101 states have return successors, (235), 223 states have call predecessors, (235), 235 states have call successors, (235) [2024-11-22 09:18:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2311 transitions. [2024-11-22 09:18:19,862 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2311 transitions. Word has length 140 [2024-11-22 09:18:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:19,862 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2311 transitions. [2024-11-22 09:18:19,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-22 09:18:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2311 transitions. [2024-11-22 09:18:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 09:18:19,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:19,864 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:19,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 09:18:20,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-22 09:18:20,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:20,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1497174563, now seen corresponding path program 1 times [2024-11-22 09:18:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574851777] [2024-11-22 09:18:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574851777] [2024-11-22 09:18:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574851777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:20,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:20,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:18:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464748384] [2024-11-22 09:18:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:18:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:18:20,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:18:20,106 INFO L87 Difference]: Start difference. First operand 1755 states and 2311 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:20,225 INFO L93 Difference]: Finished difference Result 2673 states and 3556 transitions. [2024-11-22 09:18:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:18:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-22 09:18:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:20,231 INFO L225 Difference]: With dead ends: 2673 [2024-11-22 09:18:20,232 INFO L226 Difference]: Without dead ends: 1813 [2024-11-22 09:18:20,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:18:20,234 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 123 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:20,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 270 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:18:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-22 09:18:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1635. [2024-11-22 09:18:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1298 states have (on average 1.2812018489984591) internal successors, (1663), 1310 states have internal predecessors, (1663), 235 states have call successors, (235), 101 states have call predecessors, (235), 101 states have return successors, (235), 223 states have call predecessors, (235), 235 states have call successors, (235) [2024-11-22 09:18:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2133 transitions. [2024-11-22 09:18:20,365 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2133 transitions. Word has length 140 [2024-11-22 09:18:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:20,365 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2133 transitions. [2024-11-22 09:18:20,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2133 transitions. [2024-11-22 09:18:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 09:18:20,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:20,368 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:20,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 09:18:20,368 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:20,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1798939843, now seen corresponding path program 1 times [2024-11-22 09:18:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487134126] [2024-11-22 09:18:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:20,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:20,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487134126] [2024-11-22 09:18:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487134126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:20,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:20,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 09:18:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650680139] [2024-11-22 09:18:20,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:20,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 09:18:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:20,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 09:18:20,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 09:18:20,752 INFO L87 Difference]: Start difference. First operand 1635 states and 2133 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:21,475 INFO L93 Difference]: Finished difference Result 5227 states and 6641 transitions. [2024-11-22 09:18:21,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 09:18:21,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-22 09:18:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:21,487 INFO L225 Difference]: With dead ends: 5227 [2024-11-22 09:18:21,487 INFO L226 Difference]: Without dead ends: 3693 [2024-11-22 09:18:21,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-22 09:18:21,491 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 199 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:21,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 602 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 09:18:21,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2024-11-22 09:18:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 1352. [2024-11-22 09:18:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1081 states have (on average 1.297872340425532) internal successors, (1403), 1089 states have internal predecessors, (1403), 191 states have call successors, (191), 79 states have call predecessors, (191), 79 states have return successors, (191), 183 states have call predecessors, (191), 191 states have call successors, (191) [2024-11-22 09:18:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1785 transitions. [2024-11-22 09:18:21,648 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1785 transitions. Word has length 140 [2024-11-22 09:18:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1785 transitions. [2024-11-22 09:18:21,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1785 transitions. [2024-11-22 09:18:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 09:18:21,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:21,654 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:21,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 09:18:21,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:21,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash -353590963, now seen corresponding path program 1 times [2024-11-22 09:18:21,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:21,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900859495] [2024-11-22 09:18:21,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:21,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:24,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:24,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900859495] [2024-11-22 09:18:24,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900859495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:24,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:24,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-22 09:18:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294860244] [2024-11-22 09:18:24,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:24,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 09:18:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:24,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 09:18:24,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-22 09:18:24,260 INFO L87 Difference]: Start difference. First operand 1352 states and 1785 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:27,781 INFO L93 Difference]: Finished difference Result 2802 states and 3684 transitions. [2024-11-22 09:18:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-22 09:18:27,782 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-11-22 09:18:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:27,788 INFO L225 Difference]: With dead ends: 2802 [2024-11-22 09:18:27,788 INFO L226 Difference]: Without dead ends: 1546 [2024-11-22 09:18:27,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2024-11-22 09:18:27,790 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 447 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:27,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1217 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 09:18:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-22 09:18:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 928. [2024-11-22 09:18:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 762 states have (on average 1.304461942257218) internal successors, (994), 764 states have internal predecessors, (994), 117 states have call successors, (117), 48 states have call predecessors, (117), 48 states have return successors, (117), 115 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-22 09:18:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1228 transitions. [2024-11-22 09:18:27,876 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1228 transitions. Word has length 141 [2024-11-22 09:18:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:27,876 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1228 transitions. [2024-11-22 09:18:27,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1228 transitions. [2024-11-22 09:18:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 09:18:27,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:27,877 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:27,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 09:18:27,877 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:27,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash -51825683, now seen corresponding path program 1 times [2024-11-22 09:18:27,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:27,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067095368] [2024-11-22 09:18:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:27,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067095368] [2024-11-22 09:18:28,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067095368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:28,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:28,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 09:18:28,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216358004] [2024-11-22 09:18:28,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:28,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 09:18:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:28,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 09:18:28,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 09:18:28,109 INFO L87 Difference]: Start difference. First operand 928 states and 1228 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:28,459 INFO L93 Difference]: Finished difference Result 2094 states and 2746 transitions. [2024-11-22 09:18:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 09:18:28,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-11-22 09:18:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:28,464 INFO L225 Difference]: With dead ends: 2094 [2024-11-22 09:18:28,468 INFO L226 Difference]: Without dead ends: 1254 [2024-11-22 09:18:28,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 09:18:28,470 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 75 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:28,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 811 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 09:18:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-22 09:18:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 966. [2024-11-22 09:18:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 800 states have (on average 1.3025) internal successors, (1042), 802 states have internal predecessors, (1042), 117 states have call successors, (117), 48 states have call predecessors, (117), 48 states have return successors, (117), 115 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-22 09:18:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1276 transitions. [2024-11-22 09:18:28,556 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1276 transitions. Word has length 141 [2024-11-22 09:18:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:28,556 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1276 transitions. [2024-11-22 09:18:28,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1276 transitions. [2024-11-22 09:18:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 09:18:28,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:28,557 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:28,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 09:18:28,558 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:28,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1501145099, now seen corresponding path program 1 times [2024-11-22 09:18:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707190653] [2024-11-22 09:18:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:28,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:28,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:28,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707190653] [2024-11-22 09:18:28,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707190653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:28,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:28,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:18:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367952966] [2024-11-22 09:18:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:18:28,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:28,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:18:28,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:18:28,607 INFO L87 Difference]: Start difference. First operand 966 states and 1276 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:28,744 INFO L93 Difference]: Finished difference Result 1987 states and 2637 transitions. [2024-11-22 09:18:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:18:28,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-11-22 09:18:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:28,755 INFO L225 Difference]: With dead ends: 1987 [2024-11-22 09:18:28,759 INFO L226 Difference]: Without dead ends: 1109 [2024-11-22 09:18:28,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:18:28,761 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 27 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:28,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 247 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:18:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-11-22 09:18:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 975. [2024-11-22 09:18:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 809 states have (on average 1.3016069221260815) internal successors, (1053), 811 states have internal predecessors, (1053), 117 states have call successors, (117), 48 states have call predecessors, (117), 48 states have return successors, (117), 115 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-22 09:18:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1287 transitions. [2024-11-22 09:18:28,846 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1287 transitions. Word has length 141 [2024-11-22 09:18:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:28,846 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1287 transitions. [2024-11-22 09:18:28,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1287 transitions. [2024-11-22 09:18:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 09:18:28,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:28,847 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:28,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 09:18:28,848 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 881763910, now seen corresponding path program 1 times [2024-11-22 09:18:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382382709] [2024-11-22 09:18:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 09:18:28,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667706277] [2024-11-22 09:18:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:28,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:28,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:18:28,903 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:18:28,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 09:18:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:29,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 09:18:29,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:18:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-22 09:18:29,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 09:18:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 09:18:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382382709] [2024-11-22 09:18:29,818 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 09:18:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667706277] [2024-11-22 09:18:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667706277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 09:18:29,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 09:18:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-22 09:18:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049485016] [2024-11-22 09:18:29,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 09:18:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 09:18:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 09:18:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-22 09:18:29,820 INFO L87 Difference]: Start difference. First operand 975 states and 1287 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-22 09:18:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:30,904 INFO L93 Difference]: Finished difference Result 2705 states and 3524 transitions. [2024-11-22 09:18:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 09:18:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 141 [2024-11-22 09:18:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:30,910 INFO L225 Difference]: With dead ends: 2705 [2024-11-22 09:18:30,910 INFO L226 Difference]: Without dead ends: 1808 [2024-11-22 09:18:30,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2024-11-22 09:18:30,913 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 385 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:30,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 988 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 09:18:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2024-11-22 09:18:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1114. [2024-11-22 09:18:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 945 states have (on average 1.2962962962962963) internal successors, (1225), 947 states have internal predecessors, (1225), 117 states have call successors, (117), 51 states have call predecessors, (117), 51 states have return successors, (117), 115 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-22 09:18:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1459 transitions. [2024-11-22 09:18:31,005 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1459 transitions. Word has length 141 [2024-11-22 09:18:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:31,005 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1459 transitions. [2024-11-22 09:18:31,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-22 09:18:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1459 transitions. [2024-11-22 09:18:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 09:18:31,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:31,007 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:31,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-22 09:18:31,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:31,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:31,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash -57407417, now seen corresponding path program 1 times [2024-11-22 09:18:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517211975] [2024-11-22 09:18:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 09:18:31,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517211975] [2024-11-22 09:18:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517211975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:31,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:31,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:18:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486723894] [2024-11-22 09:18:31,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:31,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:18:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 09:18:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:18:31,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:18:31,265 INFO L87 Difference]: Start difference. First operand 1114 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:31,389 INFO L93 Difference]: Finished difference Result 2258 states and 2957 transitions. [2024-11-22 09:18:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:18:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-11-22 09:18:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:31,398 INFO L225 Difference]: With dead ends: 2258 [2024-11-22 09:18:31,398 INFO L226 Difference]: Without dead ends: 1227 [2024-11-22 09:18:31,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:18:31,400 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 30 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:31,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 265 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:18:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-22 09:18:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1098. [2024-11-22 09:18:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 929 states have (on average 1.2841765339074274) internal successors, (1193), 931 states have internal predecessors, (1193), 117 states have call successors, (117), 51 states have call predecessors, (117), 51 states have return successors, (117), 115 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-22 09:18:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1427 transitions. [2024-11-22 09:18:31,571 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1427 transitions. Word has length 141 [2024-11-22 09:18:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:31,572 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1427 transitions. [2024-11-22 09:18:31,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1427 transitions. [2024-11-22 09:18:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-22 09:18:31,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:31,573 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:31,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 09:18:31,574 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 372290820, now seen corresponding path program 1 times [2024-11-22 09:18:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 09:18:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561169786] [2024-11-22 09:18:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 09:18:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 09:18:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58363575] [2024-11-22 09:18:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:31,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 09:18:31,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:18:31,625 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 09:18:31,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 09:18:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 09:18:31,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 09:18:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 09:18:31,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 09:18:31,851 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 09:18:31,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 09:18:31,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-22 09:18:32,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-22 09:18:32,062 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:32,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 09:18:32,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:18:32 BoogieIcfgContainer [2024-11-22 09:18:32,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 09:18:32,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 09:18:32,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 09:18:32,165 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 09:18:32,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:17:38" (3/4) ... [2024-11-22 09:18:32,167 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 09:18:32,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 09:18:32,169 INFO L158 Benchmark]: Toolchain (without parser) took 54244.84ms. Allocated memory was 148.9MB in the beginning and 847.2MB in the end (delta: 698.4MB). Free memory was 114.1MB in the beginning and 660.1MB in the end (delta: -545.9MB). Peak memory consumption was 152.2MB. Max. memory is 16.1GB. [2024-11-22 09:18:32,169 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 09:18:32,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.49ms. Allocated memory is still 148.9MB. Free memory was 113.3MB in the beginning and 96.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 09:18:32,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.19ms. Allocated memory is still 148.9MB. Free memory was 96.5MB in the beginning and 93.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 09:18:32,170 INFO L158 Benchmark]: Boogie Preprocessor took 63.15ms. Allocated memory is still 148.9MB. Free memory was 93.2MB in the beginning and 89.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 09:18:32,170 INFO L158 Benchmark]: RCFGBuilder took 612.15ms. Allocated memory is still 148.9MB. Free memory was 89.0MB in the beginning and 94.8MB in the end (delta: -5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 09:18:32,170 INFO L158 Benchmark]: TraceAbstraction took 53215.69ms. Allocated memory was 148.9MB in the beginning and 847.2MB in the end (delta: 698.4MB). Free memory was 93.7MB in the beginning and 661.1MB in the end (delta: -567.4MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2024-11-22 09:18:32,170 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 847.2MB. Free memory is still 660.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 09:18:32,174 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.15ms. Allocated memory is still 148.9MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.49ms. Allocated memory is still 148.9MB. Free memory was 113.3MB in the beginning and 96.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.19ms. Allocated memory is still 148.9MB. Free memory was 96.5MB in the beginning and 93.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.15ms. Allocated memory is still 148.9MB. Free memory was 93.2MB in the beginning and 89.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 612.15ms. Allocated memory is still 148.9MB. Free memory was 89.0MB in the beginning and 94.8MB in the end (delta: -5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 53215.69ms. Allocated memory was 148.9MB in the beginning and 847.2MB in the end (delta: 698.4MB). Free memory was 93.7MB in the beginning and 661.1MB in the end (delta: -567.4MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 847.2MB. Free memory is still 660.1MB. 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: 19]: 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 someBinaryFLOATComparisonOperation at line 161, overapproximation of shiftLeft at line 169, overapproximation of someUnaryDOUBLEoperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 169. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_23 = 64; [L38] unsigned short int var_1_26 = 32; [L39] unsigned short int var_1_28 = 64; [L40] float var_1_30 = -0.2; [L41] float var_1_32 = -0.375; [L42] float var_1_33 = 1.4; [L43] float var_1_35 = 1.5; [L44] unsigned char last_1_var_1_10 = 32; [L45] unsigned short int last_1_var_1_12 = 16; [L46] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_3 = __VERIFIER_nondet_short() [L134] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L134] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L135] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L135] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L136] var_1_5 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L137] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L138] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L138] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L139] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L139] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L140] var_1_6 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L141] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L143] var_1_7 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L147] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L149] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L150] var_1_11 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L151] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L152] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L154] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L156] var_1_30 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L157] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L158] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L158] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L159] var_1_32 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L160] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L161] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L161] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L177] RET updateVariables() [L178] CALL step() [L50] COND FALSE !(var_1_15 || var_1_15) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L53] COND FALSE !(((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L58] COND TRUE var_1_11 <= var_1_12 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L59] COND FALSE !(var_1_11 <= (((((var_1_11) < (var_1_6)) ? (var_1_11) : (var_1_6))) / var_1_6)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L73] COND FALSE !((var_1_9 / var_1_30) > ((((var_1_8 / var_1_32) < 0 ) ? -(var_1_8 / var_1_32) : (var_1_8 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L78] var_1_33 = var_1_8 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L79] COND FALSE !(((256 - var_1_11) <= (var_1_11 + var_1_10)) || var_1_15) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L86] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L87] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L89] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L90] COND TRUE var_1_6 <= stepLocal_2 [L91] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L95] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L95] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L102] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L104] var_1_18 = var_1_3 [L105] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L106] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L107] COND FALSE !((- var_1_9) <= var_1_8) [L120] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L122] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L123] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L123] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L124] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=2, stepLocal_4=2, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L178] RET step() [L179] CALL, EXPR property() [L169] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L169] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L169] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L169] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L169] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L169-L170] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=2, var_1_11=2, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=2, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.1s, OverallIterations: 21, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7353 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7295 mSDsluCounter, 14331 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11135 mSDsCounter, 586 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11250 IncrementalHoareTripleChecker+Invalid, 11836 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 586 mSolverCounterUnsat, 3196 mSDtfsCounter, 11250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2864 GetRequests, 2449 SyntacticMatches, 0 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5549 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1755occurred in iteration=13, InterpolantAutomatonStates: 302, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 11718 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 4591 NumberOfCodeBlocks, 4591 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4965 ConstructedInterpolants, 15 QuantifiedInterpolants, 25347 SizeOfPredicates, 82 NumberOfNonLiveVariables, 3651 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 36 InterpolantComputations, 15 PerfectInterpolantSequences, 23646/24624 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 [2024-11-22 09:18:32,390 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-22 09:18:32,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d798965d86660c5110959c1d057cdab017d50d3759f8bb695ae6218245b649d7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 09:18:34,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 09:18:34,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 09:18:34,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 09:18:34,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 09:18:34,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 09:18:34,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 09:18:34,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 09:18:34,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 09:18:34,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 09:18:34,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 09:18:34,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 09:18:34,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 09:18:34,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 09:18:34,453 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 09:18:34,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 09:18:34,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 09:18:34,454 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 09:18:34,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 09:18:34,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 09:18:34,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 09:18:34,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 09:18:34,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 09:18:34,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 09:18:34,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 09:18:34,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 09:18:34,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 09:18:34,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 09:18:34,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 09:18:34,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 09:18:34,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 09:18:34,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 09:18:34,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 09:18:34,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 09:18:34,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:18:34,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 09:18:34,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 09:18:34,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 09:18:34,460 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 09:18:34,460 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 09:18:34,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 09:18:34,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 09:18:34,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 09:18:34,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 09:18:34,463 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d798965d86660c5110959c1d057cdab017d50d3759f8bb695ae6218245b649d7 [2024-11-22 09:18:34,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 09:18:34,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 09:18:34,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 09:18:34,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 09:18:34,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 09:18:34,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i [2024-11-22 09:18:36,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 09:18:36,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 09:18:36,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i [2024-11-22 09:18:36,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5621c3e/61deeea374744ac785a10af5c24cc8c6/FLAGa7bc5d3fb [2024-11-22 09:18:36,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5621c3e/61deeea374744ac785a10af5c24cc8c6 [2024-11-22 09:18:36,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 09:18:36,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 09:18:36,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 09:18:36,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 09:18:36,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 09:18:36,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:18:36" (1/1) ... [2024-11-22 09:18:36,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4116fbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:36, skipping insertion in model container [2024-11-22 09:18:36,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:18:36" (1/1) ... [2024-11-22 09:18:36,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 09:18:36,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i[918,931] [2024-11-22 09:18:37,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:18:37,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 09:18:37,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i[918,931] [2024-11-22 09:18:37,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 09:18:37,142 INFO L204 MainTranslator]: Completed translation [2024-11-22 09:18:37,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37 WrapperNode [2024-11-22 09:18:37,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 09:18:37,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 09:18:37,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 09:18:37,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 09:18:37,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,197 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-11-22 09:18:37,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 09:18:37,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 09:18:37,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 09:18:37,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 09:18:37,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,282 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 09:18:37,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 09:18:37,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 09:18:37,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 09:18:37,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 09:18:37,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (1/1) ... [2024-11-22 09:18:37,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 09:18:37,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 09:18:37,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 09:18:37,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 09:18:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 09:18:37,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 09:18:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 09:18:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 09:18:37,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 09:18:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 09:18:37,487 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 09:18:37,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 09:18:46,714 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-22 09:18:46,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 09:18:46,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 09:18:46,732 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 09:18:46,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:18:46 BoogieIcfgContainer [2024-11-22 09:18:46,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 09:18:46,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 09:18:46,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 09:18:46,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 09:18:46,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:18:36" (1/3) ... [2024-11-22 09:18:46,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79bbb97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:18:46, skipping insertion in model container [2024-11-22 09:18:46,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:18:37" (2/3) ... [2024-11-22 09:18:46,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79bbb97f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:18:46, skipping insertion in model container [2024-11-22 09:18:46,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:18:46" (3/3) ... [2024-11-22 09:18:46,745 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-9.i [2024-11-22 09:18:46,765 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 09:18:46,765 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 09:18:46,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 09:18:46,837 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@684f9364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 09:18:46,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 09:18:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 53 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 09:18:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 09:18:46,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:46,852 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:46,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:46,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:46,858 INFO L85 PathProgramCache]: Analyzing trace with hash 8462123, now seen corresponding path program 1 times [2024-11-22 09:18:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:18:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928805922] [2024-11-22 09:18:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:46,891 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 [2024-11-22 09:18:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:18:46,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2024-11-22 09:18:46,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-11-22 09:18:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:48,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 09:18:48,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:18:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-22 09:18:48,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:18:48,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 09:18:48,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928805922] [2024-11-22 09:18:48,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928805922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:48,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:48,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 09:18:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591480863] [2024-11-22 09:18:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:48,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 09:18:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 09:18:48,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 09:18:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 09:18:48,402 INFO L87 Difference]: Start difference. First operand has 74 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 53 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 09:18:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:48,430 INFO L93 Difference]: Finished difference Result 140 states and 245 transitions. [2024-11-22 09:18:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 09:18:48,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 129 [2024-11-22 09:18:48,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:48,439 INFO L225 Difference]: With dead ends: 140 [2024-11-22 09:18:48,439 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 09:18:48,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 09:18:48,446 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:48,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 09:18:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 09:18:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-22 09:18:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 09:18:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions. [2024-11-22 09:18:48,491 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 129 [2024-11-22 09:18:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:48,493 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 106 transitions. [2024-11-22 09:18:48,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-22 09:18:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions. [2024-11-22 09:18:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 09:18:48,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:48,497 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:48,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-11-22 09:18:48,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-11-22 09:18:48,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:48,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1688860533, now seen corresponding path program 1 times [2024-11-22 09:18:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:18:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109265772] [2024-11-22 09:18:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:48,705 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 [2024-11-22 09:18:48,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:18:48,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2024-11-22 09:18:48,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-11-22 09:18:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:50,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 09:18:50,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 09:18:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-22 09:18:50,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 09:18:50,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 09:18:50,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109265772] [2024-11-22 09:18:50,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109265772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 09:18:50,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 09:18:50,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 09:18:50,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338104863] [2024-11-22 09:18:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 09:18:50,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 09:18:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 09:18:50,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 09:18:50,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:18:50,438 INFO L87 Difference]: Start difference. First operand 69 states and 106 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 09:18:50,980 INFO L93 Difference]: Finished difference Result 188 states and 289 transitions. [2024-11-22 09:18:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 09:18:50,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 130 [2024-11-22 09:18:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 09:18:50,992 INFO L225 Difference]: With dead ends: 188 [2024-11-22 09:18:50,992 INFO L226 Difference]: Without dead ends: 122 [2024-11-22 09:18:50,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 09:18:50,995 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 78 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 09:18:50,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 208 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 09:18:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-22 09:18:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-11-22 09:18:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 85 states have internal predecessors, (117), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 09:18:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2024-11-22 09:18:51,013 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 130 [2024-11-22 09:18:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 09:18:51,014 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2024-11-22 09:18:51,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-22 09:18:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2024-11-22 09:18:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 09:18:51,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 09:18:51,016 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 09:18:51,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-11-22 09:18:51,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-11-22 09:18:51,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 09:18:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 09:18:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1788458313, now seen corresponding path program 1 times [2024-11-22 09:18:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 09:18:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206030554] [2024-11-22 09:18:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 09:18:51,220 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 [2024-11-22 09:18:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 09:18:51,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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) [2024-11-22 09:18:51,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2024-11-22 09:18:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 09:18:52,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 09:18:52,590 INFO L278 TraceCheckSpWp]: Computing forward predicates...