./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_fillercodesize_normal_file-3.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:36:55,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:36:55,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:36:55,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:36:55,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:36:55,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:36:55,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:36:55,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:36:55,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:36:55,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:36:55,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:36:55,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:36:55,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:36:55,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:36:55,724 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:36:55,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:36:55,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:36:55,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:36:55,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:36:55,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:36:55,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:36:55,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:36:55,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:36:55,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:36:55,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:36:55,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:36:55,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:36:55,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:36:55,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:36:55,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:36:55,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:36:55,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:36:55,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:36:55,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:36:55,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:36:55,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:36:55,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:36:55,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:36:55,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:36:55,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:36:55,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:36:55,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:36:55,736 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-11-16 12:36:56,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:36:56,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:36:56,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:36:56,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:36:56,029 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:36:56,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-16 12:36:57,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:36:57,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:36:57,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-16 12:36:57,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f40c565c/86979208f4db4284b3b73ae532d90948/FLAGa5e5ffdbf [2024-11-16 12:36:57,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f40c565c/86979208f4db4284b3b73ae532d90948 [2024-11-16 12:36:57,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:36:57,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:36:57,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:36:57,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:36:57,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:36:57,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:36:57" (1/1) ... [2024-11-16 12:36:57,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f70cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:57, skipping insertion in model container [2024-11-16 12:36:57,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:36:57" (1/1) ... [2024-11-16 12:36:57,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:36:57,896 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_fillercodesize_normal_file-3.i[912,925] [2024-11-16 12:36:57,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:36:57,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:36:57,979 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_fillercodesize_normal_file-3.i[912,925] [2024-11-16 12:36:58,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:36:58,024 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:36:58,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58 WrapperNode [2024-11-16 12:36:58,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:36:58,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:36:58,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:36:58,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:36:58,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,086 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-16 12:36:58,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:36:58,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:36:58,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:36:58,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:36:58,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,123 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-16 12:36:58,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:36:58,148 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:36:58,148 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:36:58,148 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:36:58,149 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (1/1) ... [2024-11-16 12:36:58,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:36:58,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:36:58,190 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-16 12:36:58,197 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-16 12:36:58,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:36:58,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:36:58,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:36:58,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:36:58,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:36:58,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:36:58,308 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:36:58,310 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:36:58,612 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2024-11-16 12:36:58,654 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 12:36:58,654 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:36:58,675 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:36:58,676 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:36:58,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:36:58 BoogieIcfgContainer [2024-11-16 12:36:58,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:36:58,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:36:58,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:36:58,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:36:58,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:36:57" (1/3) ... [2024-11-16 12:36:58,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d27e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:36:58, skipping insertion in model container [2024-11-16 12:36:58,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:58" (2/3) ... [2024-11-16 12:36:58,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d27e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:36:58, skipping insertion in model container [2024-11-16 12:36:58,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:36:58" (3/3) ... [2024-11-16 12:36:58,684 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-16 12:36:58,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:36:58,706 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:36:58,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:36:58,762 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;@1fdfdb6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:36:58,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:36:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:36:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 12:36:58,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:36:58,775 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:36:58,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:36:58,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:36:58,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1534971193, now seen corresponding path program 1 times [2024-11-16 12:36:58,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:36:58,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174295022] [2024-11-16 12:36:58,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:36:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:36:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:36:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:36:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:36:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:36:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:36:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:36:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:36:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:36:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:36:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:36:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:36:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:36:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:36:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:36:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:36:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:36:59,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:36:59,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174295022] [2024-11-16 12:36:59,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174295022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:36:59,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:36:59,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:36:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188585159] [2024-11-16 12:36:59,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:36:59,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:36:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:36:59,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:36:59,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:36:59,210 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:36:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:36:59,240 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2024-11-16 12:36:59,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:36:59,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2024-11-16 12:36:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:36:59,250 INFO L225 Difference]: With dead ends: 140 [2024-11-16 12:36:59,250 INFO L226 Difference]: Without dead ends: 69 [2024-11-16 12:36:59,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-16 12:36:59,257 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:36:59,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:36:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-16 12:36:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-16 12:36:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:36:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-11-16 12:36:59,359 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 107 [2024-11-16 12:36:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:36:59,360 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-11-16 12:36:59,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:36:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-11-16 12:36:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 12:36:59,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:36:59,365 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:36:59,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:36:59,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:36:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:36:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1048743034, now seen corresponding path program 1 times [2024-11-16 12:36:59,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:36:59,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598595258] [2024-11-16 12:36:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:36:59,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:36:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:36:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:36:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:36:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:36:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:36:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:36:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:36:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:36:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:36:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:36:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:36:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:36:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:36:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:36:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:36:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:36:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:36:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:36:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598595258] [2024-11-16 12:36:59,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598595258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:36:59,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:36:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:36:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574151350] [2024-11-16 12:36:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:36:59,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:36:59,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:36:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:36:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:36:59,932 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:00,018 INFO L93 Difference]: Finished difference Result 201 states and 306 transitions. [2024-11-16 12:37:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:37:00,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-16 12:37:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:00,024 INFO L225 Difference]: With dead ends: 201 [2024-11-16 12:37:00,024 INFO L226 Difference]: Without dead ends: 135 [2024-11-16 12:37:00,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-16 12:37:00,028 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:00,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:37:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-16 12:37:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-16 12:37:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:37:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2024-11-16 12:37:00,056 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 107 [2024-11-16 12:37:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:00,057 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2024-11-16 12:37:00,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2024-11-16 12:37:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:37:00,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:00,059 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:00,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:37:00,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:00,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash -235237029, now seen corresponding path program 1 times [2024-11-16 12:37:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:00,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344221778] [2024-11-16 12:37:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344221778] [2024-11-16 12:37:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344221778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:37:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889125064] [2024-11-16 12:37:00,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:37:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:37:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:37:00,208 INFO L87 Difference]: Start difference. First operand 132 states and 199 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:00,281 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2024-11-16 12:37:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:37:00,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-16 12:37:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:00,284 INFO L225 Difference]: With dead ends: 328 [2024-11-16 12:37:00,284 INFO L226 Difference]: Without dead ends: 199 [2024-11-16 12:37:00,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-16 12:37:00,290 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 45 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:00,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 219 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:37:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-16 12:37:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 150. [2024-11-16 12:37:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.4102564102564104) internal successors, (165), 117 states have internal predecessors, (165), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:37:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2024-11-16 12:37:00,313 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 108 [2024-11-16 12:37:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:00,313 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2024-11-16 12:37:00,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2024-11-16 12:37:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:37:00,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:00,316 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:00,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:37:00,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -458972550, now seen corresponding path program 1 times [2024-11-16 12:37:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275395414] [2024-11-16 12:37:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275395414] [2024-11-16 12:37:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275395414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:37:00,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823948210] [2024-11-16 12:37:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:00,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:37:00,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:00,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:37:00,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:37:00,539 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:00,637 INFO L93 Difference]: Finished difference Result 436 states and 659 transitions. [2024-11-16 12:37:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:37:00,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-16 12:37:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:00,641 INFO L225 Difference]: With dead ends: 436 [2024-11-16 12:37:00,642 INFO L226 Difference]: Without dead ends: 289 [2024-11-16 12:37:00,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-16 12:37:00,646 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 88 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:00,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 261 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:37:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-16 12:37:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2024-11-16 12:37:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.3981900452488687) internal successors, (309), 221 states have internal predecessors, (309), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 12:37:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 429 transitions. [2024-11-16 12:37:00,694 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 429 transitions. Word has length 108 [2024-11-16 12:37:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:00,697 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 429 transitions. [2024-11-16 12:37:00,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 429 transitions. [2024-11-16 12:37:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 12:37:00,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:00,700 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:00,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:37:00,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:00,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash 822252610, now seen corresponding path program 1 times [2024-11-16 12:37:00,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:00,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539754563] [2024-11-16 12:37:00,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:00,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:00,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:01,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:01,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:01,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539754563] [2024-11-16 12:37:01,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539754563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:01,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:01,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:37:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965380235] [2024-11-16 12:37:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:01,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:37:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:37:01,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:37:01,017 INFO L87 Difference]: Start difference. First operand 286 states and 429 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:01,265 INFO L93 Difference]: Finished difference Result 716 states and 1077 transitions. [2024-11-16 12:37:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:37:01,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-16 12:37:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:01,273 INFO L225 Difference]: With dead ends: 716 [2024-11-16 12:37:01,273 INFO L226 Difference]: Without dead ends: 573 [2024-11-16 12:37:01,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:37:01,276 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 119 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:01,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 312 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:37:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-16 12:37:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 564. [2024-11-16 12:37:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 435 states have (on average 1.4045977011494253) internal successors, (611), 435 states have internal predecessors, (611), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-16 12:37:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 851 transitions. [2024-11-16 12:37:01,350 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 851 transitions. Word has length 109 [2024-11-16 12:37:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:01,350 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 851 transitions. [2024-11-16 12:37:01,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 851 transitions. [2024-11-16 12:37:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 12:37:01,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:01,354 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:01,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:37:01,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:01,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash -882694174, now seen corresponding path program 1 times [2024-11-16 12:37:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:01,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733959927] [2024-11-16 12:37:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:01,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 12:37:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733959927] [2024-11-16 12:37:02,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733959927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:02,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:02,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:37:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192697301] [2024-11-16 12:37:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:02,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:37:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:02,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:37:02,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:37:02,408 INFO L87 Difference]: Start difference. First operand 564 states and 851 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:03,246 INFO L93 Difference]: Finished difference Result 1731 states and 2517 transitions. [2024-11-16 12:37:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 12:37:03,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-16 12:37:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:03,280 INFO L225 Difference]: With dead ends: 1731 [2024-11-16 12:37:03,280 INFO L226 Difference]: Without dead ends: 1170 [2024-11-16 12:37:03,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-11-16 12:37:03,283 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 265 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:03,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 336 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:37:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-11-16 12:37:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 704. [2024-11-16 12:37:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 567 states have (on average 1.4197530864197532) internal successors, (805), 567 states have internal predecessors, (805), 120 states have call successors, (120), 16 states have call predecessors, (120), 16 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-16 12:37:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1045 transitions. [2024-11-16 12:37:03,366 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1045 transitions. Word has length 109 [2024-11-16 12:37:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:03,367 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1045 transitions. [2024-11-16 12:37:03,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1045 transitions. [2024-11-16 12:37:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 12:37:03,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:03,369 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:03,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:37:03,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:03,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:03,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1879766527, now seen corresponding path program 1 times [2024-11-16 12:37:03,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:03,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392633266] [2024-11-16 12:37:03,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:03,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:03,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:03,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392633266] [2024-11-16 12:37:03,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392633266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:03,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:03,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:37:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219069617] [2024-11-16 12:37:03,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:03,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:37:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:03,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:37:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:37:03,595 INFO L87 Difference]: Start difference. First operand 704 states and 1045 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:03,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:03,741 INFO L93 Difference]: Finished difference Result 1712 states and 2541 transitions. [2024-11-16 12:37:03,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:37:03,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-16 12:37:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:03,747 INFO L225 Difference]: With dead ends: 1712 [2024-11-16 12:37:03,748 INFO L226 Difference]: Without dead ends: 1011 [2024-11-16 12:37:03,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-16 12:37:03,752 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 63 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:03,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 212 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:37:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-11-16 12:37:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1008. [2024-11-16 12:37:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 803 states have (on average 1.405977584059776) internal successors, (1129), 803 states have internal predecessors, (1129), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-16 12:37:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1489 transitions. [2024-11-16 12:37:03,881 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1489 transitions. Word has length 109 [2024-11-16 12:37:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:03,881 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1489 transitions. [2024-11-16 12:37:03,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1489 transitions. [2024-11-16 12:37:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:37:03,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:03,883 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:03,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:37:03,883 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:03,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash -22203007, now seen corresponding path program 1 times [2024-11-16 12:37:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107440591] [2024-11-16 12:37:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:04,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107440591] [2024-11-16 12:37:04,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107440591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:04,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:04,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:37:04,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098796028] [2024-11-16 12:37:04,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:04,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:37:04,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:04,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:37:04,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:37:04,136 INFO L87 Difference]: Start difference. First operand 1008 states and 1489 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:37:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:04,690 INFO L93 Difference]: Finished difference Result 1898 states and 2803 transitions. [2024-11-16 12:37:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:37:04,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2024-11-16 12:37:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:04,699 INFO L225 Difference]: With dead ends: 1898 [2024-11-16 12:37:04,699 INFO L226 Difference]: Without dead ends: 1644 [2024-11-16 12:37:04,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:37:04,701 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 286 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:04,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 395 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:37:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-16 12:37:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1490. [2024-11-16 12:37:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1183 states have (on average 1.404902789518174) internal successors, (1662), 1183 states have internal predecessors, (1662), 270 states have call successors, (270), 36 states have call predecessors, (270), 36 states have return successors, (270), 270 states have call predecessors, (270), 270 states have call successors, (270) [2024-11-16 12:37:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2202 transitions. [2024-11-16 12:37:04,855 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2202 transitions. Word has length 110 [2024-11-16 12:37:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:04,855 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 2202 transitions. [2024-11-16 12:37:04,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:37:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2202 transitions. [2024-11-16 12:37:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:37:04,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:04,857 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:04,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:37:04,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:04,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:04,858 INFO L85 PathProgramCache]: Analyzing trace with hash 180580122, now seen corresponding path program 1 times [2024-11-16 12:37:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:04,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450634125] [2024-11-16 12:37:04,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:04,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450634125] [2024-11-16 12:37:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450634125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:37:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308660976] [2024-11-16 12:37:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:05,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:37:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:05,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:37:05,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:37:05,132 INFO L87 Difference]: Start difference. First operand 1490 states and 2202 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:05,451 INFO L93 Difference]: Finished difference Result 2624 states and 3876 transitions. [2024-11-16 12:37:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:37:05,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2024-11-16 12:37:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:05,461 INFO L225 Difference]: With dead ends: 2624 [2024-11-16 12:37:05,461 INFO L226 Difference]: Without dead ends: 1872 [2024-11-16 12:37:05,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:37:05,464 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 188 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:05,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 375 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:37:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2024-11-16 12:37:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1610. [2024-11-16 12:37:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1303 states have (on average 1.4167306216423639) internal successors, (1846), 1303 states have internal predecessors, (1846), 270 states have call successors, (270), 36 states have call predecessors, (270), 36 states have return successors, (270), 270 states have call predecessors, (270), 270 states have call successors, (270) [2024-11-16 12:37:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2386 transitions. [2024-11-16 12:37:05,660 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2386 transitions. Word has length 110 [2024-11-16 12:37:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:05,661 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2386 transitions. [2024-11-16 12:37:05,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2386 transitions. [2024-11-16 12:37:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:37:05,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:05,663 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:37:05,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:05,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 809172951, now seen corresponding path program 1 times [2024-11-16 12:37:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006588537] [2024-11-16 12:37:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:37:06,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:06,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006588537] [2024-11-16 12:37:06,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006588537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:37:06,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18959960] [2024-11-16 12:37:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:06,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:37:06,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:37:06,471 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-16 12:37:06,472 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-16 12:37:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:06,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 12:37:06,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:37:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 287 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 12:37:07,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:37:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 30 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-16 12:37:08,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18959960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:37:08,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:37:08,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 25 [2024-11-16 12:37:08,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576613425] [2024-11-16 12:37:08,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:37:08,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-16 12:37:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:08,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-16 12:37:08,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2024-11-16 12:37:08,027 INFO L87 Difference]: Start difference. First operand 1610 states and 2386 transitions. Second operand has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-16 12:37:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:09,348 INFO L93 Difference]: Finished difference Result 3034 states and 4352 transitions. [2024-11-16 12:37:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-16 12:37:09,349 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) Word has length 110 [2024-11-16 12:37:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:09,358 INFO L225 Difference]: With dead ends: 3034 [2024-11-16 12:37:09,358 INFO L226 Difference]: Without dead ends: 1841 [2024-11-16 12:37:09,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=611, Invalid=1369, Unknown=0, NotChecked=0, Total=1980 [2024-11-16 12:37:09,363 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 283 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:09,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 369 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:37:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2024-11-16 12:37:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1292. [2024-11-16 12:37:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1025 states have (on average 1.3570731707317074) internal successors, (1391), 1025 states have internal predecessors, (1391), 210 states have call successors, (210), 56 states have call predecessors, (210), 56 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-16 12:37:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1811 transitions. [2024-11-16 12:37:09,538 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1811 transitions. Word has length 110 [2024-11-16 12:37:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:09,538 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1811 transitions. [2024-11-16 12:37:09,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-16 12:37:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1811 transitions. [2024-11-16 12:37:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:37:09,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:09,540 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:09,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 12:37:09,744 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,SelfDestructingSolverStorable9 [2024-11-16 12:37:09,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:09,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:09,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1942018671, now seen corresponding path program 1 times [2024-11-16 12:37:09,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:09,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975994152] [2024-11-16 12:37:09,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:09,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:10,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:10,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975994152] [2024-11-16 12:37:10,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975994152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:10,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:10,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:37:10,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490454687] [2024-11-16 12:37:10,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:10,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:37:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:10,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:37:10,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:37:10,065 INFO L87 Difference]: Start difference. First operand 1292 states and 1811 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:37:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:10,646 INFO L93 Difference]: Finished difference Result 2601 states and 3640 transitions. [2024-11-16 12:37:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 12:37:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2024-11-16 12:37:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:10,657 INFO L225 Difference]: With dead ends: 2601 [2024-11-16 12:37:10,658 INFO L226 Difference]: Without dead ends: 1312 [2024-11-16 12:37:10,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:37:10,662 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 308 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:10,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 458 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:37:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-16 12:37:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1296. [2024-11-16 12:37:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1029 states have (on average 1.3537414965986394) internal successors, (1393), 1029 states have internal predecessors, (1393), 210 states have call successors, (210), 56 states have call predecessors, (210), 56 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-16 12:37:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1813 transitions. [2024-11-16 12:37:10,817 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1813 transitions. Word has length 110 [2024-11-16 12:37:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:10,817 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1813 transitions. [2024-11-16 12:37:10,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:37:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1813 transitions. [2024-11-16 12:37:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:37:10,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:10,819 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:10,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 12:37:10,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:10,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1818017953, now seen corresponding path program 1 times [2024-11-16 12:37:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967827903] [2024-11-16 12:37:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:37:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:37:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:37:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:37:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:37:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:37:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:37:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:37:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:37:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:37:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:37:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:37:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:37:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:37:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:37:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:11,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:37:11,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967827903] [2024-11-16 12:37:11,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967827903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:11,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:11,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:37:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933890636] [2024-11-16 12:37:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:11,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:37:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:37:11,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:37:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:37:11,319 INFO L87 Difference]: Start difference. First operand 1296 states and 1813 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:37:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:12,751 INFO L93 Difference]: Finished difference Result 2358 states and 3285 transitions. [2024-11-16 12:37:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 12:37:12,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-11-16 12:37:12,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:12,763 INFO L225 Difference]: With dead ends: 2358 [2024-11-16 12:37:12,763 INFO L226 Difference]: Without dead ends: 1649 [2024-11-16 12:37:12,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2024-11-16 12:37:12,766 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 359 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 12:37:12,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1111 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 12:37:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2024-11-16 12:37:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1394. [2024-11-16 12:37:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1108 states have (on average 1.3546931407942238) internal successors, (1501), 1108 states have internal predecessors, (1501), 225 states have call successors, (225), 60 states have call predecessors, (225), 60 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2024-11-16 12:37:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1951 transitions. [2024-11-16 12:37:13,026 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1951 transitions. Word has length 111 [2024-11-16 12:37:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:13,027 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1951 transitions. [2024-11-16 12:37:13,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:37:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1951 transitions. [2024-11-16 12:37:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:37:13,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:13,029 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:37:13,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 12:37:13,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:13,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1033745348, now seen corresponding path program 1 times [2024-11-16 12:37:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:37:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083929482] [2024-11-16 12:37:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:37:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:37:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891346959] [2024-11-16 12:37:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:13,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:37:13,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:37:13,078 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-16 12:37:13,079 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-16 12:37:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:37:13,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:37:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:37:13,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:37:13,333 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:37:13,334 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:37:13,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 12:37:13,535 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,SelfDestructingSolverStorable12 [2024-11-16 12:37:13,539 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:37:13,621 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:37:13,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:37:13 BoogieIcfgContainer [2024-11-16 12:37:13,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:37:13,624 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:37:13,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:37:13,624 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:37:13,625 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:36:58" (3/4) ... [2024-11-16 12:37:13,627 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:37:13,628 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:37:13,629 INFO L158 Benchmark]: Toolchain (without parser) took 15979.69ms. Allocated memory was 159.4MB in the beginning and 557.8MB in the end (delta: 398.5MB). Free memory was 89.0MB in the beginning and 333.1MB in the end (delta: -244.1MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. [2024-11-16 12:37:13,629 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:37:13,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.50ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 124.9MB in the end (delta: -36.1MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-16 12:37:13,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.24ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 120.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:37:13,629 INFO L158 Benchmark]: Boogie Preprocessor took 60.17ms. Allocated memory is still 159.4MB. Free memory was 120.8MB in the beginning and 115.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 12:37:13,629 INFO L158 Benchmark]: IcfgBuilder took 528.07ms. Allocated memory is still 159.4MB. Free memory was 115.5MB in the beginning and 91.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 12:37:13,630 INFO L158 Benchmark]: TraceAbstraction took 14945.81ms. Allocated memory was 159.4MB in the beginning and 557.8MB in the end (delta: 398.5MB). Free memory was 90.3MB in the beginning and 333.1MB in the end (delta: -242.8MB). Peak memory consumption was 154.7MB. Max. memory is 16.1GB. [2024-11-16 12:37:13,630 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 557.8MB. Free memory is still 333.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:37:13,631 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.19ms. Allocated memory is still 159.4MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.50ms. Allocated memory is still 159.4MB. Free memory was 88.9MB in the beginning and 124.9MB in the end (delta: -36.1MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.24ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 120.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.17ms. Allocated memory is still 159.4MB. Free memory was 120.8MB in the beginning and 115.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 528.07ms. Allocated memory is still 159.4MB. Free memory was 115.5MB in the beginning and 91.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14945.81ms. Allocated memory was 159.4MB in the beginning and 557.8MB in the end (delta: 398.5MB). Free memory was 90.3MB in the beginning and 333.1MB in the end (delta: -242.8MB). Peak memory consumption was 154.7MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 557.8MB. Free memory is still 333.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 someBinaryDOUBLEComparisonOperation at line 117, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L125] RET updateVariables() [L126] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-16129, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L51] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L52] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L57] COND FALSE !(stepLocal_1 || var_1_3) [L62] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L64] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2072 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2066 mSDsluCounter, 4352 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2844 mSDsCounter, 595 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2360 IncrementalHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 595 mSolverCounterUnsat, 1508 mSDtfsCounter, 2360 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 615 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1610occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1769 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1640 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1514 ConstructedInterpolants, 0 QuantifiedInterpolants, 5809 SizeOfPredicates, 7 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 5808/5880 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-16 12:37:13,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/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_fillercodesize_normal_file-3.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:37:15,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:37:15,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:37:15,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:37:15,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:37:16,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:37:16,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:37:16,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:37:16,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:37:16,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:37:16,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:37:16,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:37:16,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:37:16,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:37:16,028 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:37:16,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:37:16,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:37:16,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:37:16,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:37:16,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:37:16,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:37:16,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:37:16,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:37:16,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:37:16,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:37:16,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:37:16,035 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:37:16,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:37:16,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:37:16,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:37:16,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:37:16,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:37:16,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:37:16,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:37:16,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:37:16,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:37:16,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:37:16,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:37:16,039 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:37:16,039 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:37:16,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:37:16,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:37:16,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:37:16,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:37:16,041 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-11-16 12:37:16,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:37:16,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:37:16,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:37:16,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:37:16,390 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:37:16,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-16 12:37:17,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:37:18,192 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:37:18,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-16 12:37:18,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91b81ce8/dabfc5a6a8e24428b1bd7216265b29c2/FLAG1c8a193e1 [2024-11-16 12:37:18,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c91b81ce8/dabfc5a6a8e24428b1bd7216265b29c2 [2024-11-16 12:37:18,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:37:18,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:37:18,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:37:18,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:37:18,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:37:18,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:18,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca088d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18, skipping insertion in model container [2024-11-16 12:37:18,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:18,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:37:18,797 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_fillercodesize_normal_file-3.i[912,925] [2024-11-16 12:37:18,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:37:18,895 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:37:18,909 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_fillercodesize_normal_file-3.i[912,925] [2024-11-16 12:37:18,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:37:18,967 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:37:18,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18 WrapperNode [2024-11-16 12:37:18,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:37:18,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:37:18,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:37:18,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:37:18,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:18,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,027 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-16 12:37:19,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:37:19,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:37:19,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:37:19,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:37:19,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,079 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-16 12:37:19,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:37:19,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:37:19,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:37:19,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:37:19,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (1/1) ... [2024-11-16 12:37:19,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:37:19,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:37:19,146 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-16 12:37:19,149 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-16 12:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:37:19,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:37:19,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:37:19,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:37:19,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:37:19,262 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:37:19,264 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:37:35,579 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 12:37:35,579 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:37:35,593 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:37:35,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:37:35,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:37:35 BoogieIcfgContainer [2024-11-16 12:37:35,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:37:35,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:37:35,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:37:35,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:37:35,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:18" (1/3) ... [2024-11-16 12:37:35,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30eab040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:35, skipping insertion in model container [2024-11-16 12:37:35,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:18" (2/3) ... [2024-11-16 12:37:35,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30eab040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:35, skipping insertion in model container [2024-11-16 12:37:35,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:37:35" (3/3) ... [2024-11-16 12:37:35,603 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-16 12:37:35,619 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:37:35,619 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:37:35,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:37:35,695 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;@3e080035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:37:35,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:37:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 46 states have internal predecessors, (65), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:37:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 12:37:35,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:35,712 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:37:35,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:35,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2090833946, now seen corresponding path program 1 times [2024-11-16 12:37:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:37:35,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51864534] [2024-11-16 12:37:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:35,732 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-16 12:37:35,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:37:35,737 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-16 12:37:35,738 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-16 12:37:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:36,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:37:36,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:37:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-16 12:37:36,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:37:36,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:37:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51864534] [2024-11-16 12:37:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51864534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:36,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:36,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:37:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006577572] [2024-11-16 12:37:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:36,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:37:36,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:37:36,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:37:36,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:37:36,749 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 46 states have internal predecessors, (65), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:37:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:37:36,773 INFO L93 Difference]: Finished difference Result 118 states and 198 transitions. [2024-11-16 12:37:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:37:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-11-16 12:37:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:37:36,781 INFO L225 Difference]: With dead ends: 118 [2024-11-16 12:37:36,781 INFO L226 Difference]: Without dead ends: 58 [2024-11-16 12:37:36,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-16 12:37:36,787 INFO L432 NwaCegarLoop]: 86 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, 86 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-16 12:37:36,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:37:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-16 12:37:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-16 12:37:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:37:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-11-16 12:37:36,822 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 104 [2024-11-16 12:37:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:37:36,822 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-11-16 12:37:36,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:37:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-11-16 12:37:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 12:37:36,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:37:36,826 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:37:36,855 INFO L552 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)] Ended with exit code 0 [2024-11-16 12:37:37,026 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-16 12:37:37,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:37:37,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:37:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1387268217, now seen corresponding path program 1 times [2024-11-16 12:37:37,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:37:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844942611] [2024-11-16 12:37:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:37:37,029 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-16 12:37:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:37:37,030 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-16 12:37:37,032 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-16 12:37:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:37:37,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 12:37:37,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:37:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:37:41,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:37:41,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:37:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844942611] [2024-11-16 12:37:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844942611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:37:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:37:41,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:37:41,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056056044] [2024-11-16 12:37:41,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:37:41,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:37:41,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:37:41,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:37:41,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:37:41,174 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:37:45,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:37:47,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:37:51,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:37:55,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:37:58,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:38:03,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:38:07,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:38:11,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:38:12,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:38:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:12,494 INFO L93 Difference]: Finished difference Result 168 states and 252 transitions. [2024-11-16 12:38:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:38:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-16 12:38:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:12,667 INFO L225 Difference]: With dead ends: 168 [2024-11-16 12:38:12,671 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 12:38:12,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:38:12,673 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 31 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:12,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 265 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 31.2s Time] [2024-11-16 12:38:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 12:38:12,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-11-16 12:38:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:38:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2024-11-16 12:38:12,717 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 104 [2024-11-16 12:38:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:12,717 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-11-16 12:38:12,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:38:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2024-11-16 12:38:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 12:38:12,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:12,720 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:12,748 INFO L552 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)] Ended with exit code 0 [2024-11-16 12:38:12,920 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-16 12:38:12,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:12,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1711131138, now seen corresponding path program 1 times [2024-11-16 12:38:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:38:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588999583] [2024-11-16 12:38:12,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:12,923 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-16 12:38:12,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:38:12,924 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-16 12:38:12,925 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-16 12:38:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:13,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 12:38:13,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:38:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:38:14,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:38:14,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:38:14,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588999583] [2024-11-16 12:38:14,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588999583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:38:14,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:38:14,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:38:14,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733566471] [2024-11-16 12:38:14,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:38:14,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:38:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:38:14,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:38:14,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:38:14,027 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:38:18,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:38:22,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:38:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:22,745 INFO L93 Difference]: Finished difference Result 262 states and 389 transitions. [2024-11-16 12:38:22,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:38:22,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-11-16 12:38:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:22,752 INFO L225 Difference]: With dead ends: 262 [2024-11-16 12:38:22,752 INFO L226 Difference]: Without dead ends: 155 [2024-11-16 12:38:22,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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-16 12:38:22,757 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:22,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 153 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-16 12:38:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-16 12:38:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2024-11-16 12:38:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 95 states have internal predecessors, (128), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:38:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2024-11-16 12:38:22,808 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 105 [2024-11-16 12:38:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:22,816 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2024-11-16 12:38:22,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:38:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2024-11-16 12:38:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 12:38:22,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:22,818 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:22,863 INFO L552 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)] Ended with exit code 0 [2024-11-16 12:38:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-16 12:38:23,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash 393953672, now seen corresponding path program 1 times [2024-11-16 12:38:23,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:38:23,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000653246] [2024-11-16 12:38:23,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:23,028 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-16 12:38:23,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:38:23,033 INFO L229 MonitoredProcess]: Starting monitored process 5 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-16 12:38:23,036 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 (5)] Waiting until timeout for monitored process [2024-11-16 12:38:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:23,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 12:38:23,998 INFO L278 TraceCheckSpWp]: Computing forward predicates...