./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_fillercodestructure_filler-pr-ci_file-76.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 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:26:06,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:26:06,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:26:06,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:26:06,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:26:06,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:26:06,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:26:06,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:26:06,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:26:06,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:26:06,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:26:06,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:26:06,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:26:06,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:26:06,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:26:06,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:26:06,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:26:06,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:26:06,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:26:06,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:26:06,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:26:06,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:26:06,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:26:07,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:26:07,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:26:07,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:26:07,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:26:07,001 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:26:07,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:26:07,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:26:07,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:26:07,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:26:07,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:07,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:26:07,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:26:07,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:26:07,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:26:07,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:26:07,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:26:07,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:26:07,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:26:07,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:26:07,007 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 -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2024-11-12 03:26:07,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:26:07,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:26:07,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:26:07,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:26:07,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:26:07,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-12 03:26:08,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:26:09,000 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:26:09,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-12 03:26:09,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0c47767/af682dea21b84eb0919d20f2a4d346ee/FLAG6676abe9a [2024-11-12 03:26:09,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0c47767/af682dea21b84eb0919d20f2a4d346ee [2024-11-12 03:26:09,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:26:09,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:26:09,036 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:09,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:26:09,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:26:09,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466af8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09, skipping insertion in model container [2024-11-12 03:26:09,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:26:09,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-11-12 03:26:09,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:09,423 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:26:09,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-11-12 03:26:09,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:09,506 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:26:09,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09 WrapperNode [2024-11-12 03:26:09,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:09,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:09,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:26:09,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:26:09,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,575 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-12 03:26:09,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:09,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:26:09,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:26:09,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:26:09,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,630 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-12 03:26:09,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:26:09,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:26:09,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:26:09,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:26:09,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:09,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:09,708 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-12 03:26:09,715 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-12 03:26:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:26:09,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:26:09,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:26:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:26:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:26:09,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:26:09,861 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:26:09,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:26:10,285 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-12 03:26:10,285 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:26:10,304 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:26:10,305 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:26:10,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:10 BoogieIcfgContainer [2024-11-12 03:26:10,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:26:10,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:26:10,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:26:10,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:26:10,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:26:09" (1/3) ... [2024-11-12 03:26:10,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b79b046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:10, skipping insertion in model container [2024-11-12 03:26:10,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (2/3) ... [2024-11-12 03:26:10,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b79b046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:10, skipping insertion in model container [2024-11-12 03:26:10,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:10" (3/3) ... [2024-11-12 03:26:10,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-12 03:26:10,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:26:10,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:26:10,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:26:10,407 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;@26cb2353, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:26:10,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:26:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 69 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 03:26:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 03:26:10,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:10,426 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:10,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:10,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1854159536, now seen corresponding path program 1 times [2024-11-12 03:26:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:10,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278608567] [2024-11-12 03:26:10,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:10,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:10,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278608567] [2024-11-12 03:26:10,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278608567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:10,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:10,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:26:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556131141] [2024-11-12 03:26:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:10,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:26:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:10,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:26:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:26:10,962 INFO L87 Difference]: Start difference. First operand has 90 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 69 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 03:26:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:10,994 INFO L93 Difference]: Finished difference Result 168 states and 289 transitions. [2024-11-12 03:26:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:26:10,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2024-11-12 03:26:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:11,005 INFO L225 Difference]: With dead ends: 168 [2024-11-12 03:26:11,005 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 03:26:11,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-12 03:26:11,012 INFO L435 NwaCegarLoop]: 124 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, 124 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-12 03:26:11,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:26:11,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 03:26:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 03:26:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 03:26:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-12 03:26:11,071 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 137 [2024-11-12 03:26:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:11,072 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-12 03:26:11,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 03:26:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-12 03:26:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 03:26:11,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:11,078 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:11,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:26:11,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:11,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1080617290, now seen corresponding path program 1 times [2024-11-12 03:26:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:11,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021832185] [2024-11-12 03:26:11,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:11,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021832185] [2024-11-12 03:26:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021832185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:11,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:11,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:26:11,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222606582] [2024-11-12 03:26:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:11,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:26:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:11,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:26:11,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:26:11,766 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:12,247 INFO L93 Difference]: Finished difference Result 342 states and 518 transitions. [2024-11-12 03:26:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 03:26:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-12 03:26:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:12,251 INFO L225 Difference]: With dead ends: 342 [2024-11-12 03:26:12,253 INFO L226 Difference]: Without dead ends: 264 [2024-11-12 03:26:12,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:26:12,257 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 299 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:12,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 341 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:26:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-12 03:26:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2024-11-12 03:26:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 190 states have (on average 1.4157894736842105) internal successors, (269), 192 states have internal predecessors, (269), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 03:26:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 389 transitions. [2024-11-12 03:26:12,327 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 389 transitions. Word has length 137 [2024-11-12 03:26:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:12,332 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 389 transitions. [2024-11-12 03:26:12,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 389 transitions. [2024-11-12 03:26:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 03:26:12,338 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:12,338 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:12,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:26:12,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:12,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1626002104, now seen corresponding path program 1 times [2024-11-12 03:26:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:12,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449986155] [2024-11-12 03:26:12,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:12,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449986155] [2024-11-12 03:26:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449986155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:12,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:26:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087493926] [2024-11-12 03:26:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:12,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:26:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:26:12,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:26:12,826 INFO L87 Difference]: Start difference. First operand 255 states and 389 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:13,230 INFO L93 Difference]: Finished difference Result 883 states and 1350 transitions. [2024-11-12 03:26:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:26:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-12 03:26:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:13,243 INFO L225 Difference]: With dead ends: 883 [2024-11-12 03:26:13,243 INFO L226 Difference]: Without dead ends: 631 [2024-11-12 03:26:13,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:26:13,249 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 266 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:13,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 302 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:26:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-12 03:26:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 627. [2024-11-12 03:26:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 466 states have (on average 1.4141630901287554) internal successors, (659), 471 states have internal predecessors, (659), 150 states have call successors, (150), 10 states have call predecessors, (150), 10 states have return successors, (150), 145 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-12 03:26:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 959 transitions. [2024-11-12 03:26:13,374 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 959 transitions. Word has length 137 [2024-11-12 03:26:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:13,375 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 959 transitions. [2024-11-12 03:26:13,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 959 transitions. [2024-11-12 03:26:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 03:26:13,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:13,378 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:13,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:26:13,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2048703930, now seen corresponding path program 1 times [2024-11-12 03:26:13,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033221703] [2024-11-12 03:26:13,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033221703] [2024-11-12 03:26:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033221703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:13,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:13,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:26:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816420424] [2024-11-12 03:26:13,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:13,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:26:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:26:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:26:13,643 INFO L87 Difference]: Start difference. First operand 627 states and 959 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:14,107 INFO L93 Difference]: Finished difference Result 1448 states and 2212 transitions. [2024-11-12 03:26:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:26:14,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-12 03:26:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:14,117 INFO L225 Difference]: With dead ends: 1448 [2024-11-12 03:26:14,118 INFO L226 Difference]: Without dead ends: 822 [2024-11-12 03:26:14,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:26:14,124 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 215 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:14,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 723 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:26:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-12 03:26:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 818. [2024-11-12 03:26:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 604 states have (on average 1.3973509933774835) internal successors, (844), 610 states have internal predecessors, (844), 199 states have call successors, (199), 14 states have call predecessors, (199), 14 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2024-11-12 03:26:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1242 transitions. [2024-11-12 03:26:14,229 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1242 transitions. Word has length 137 [2024-11-12 03:26:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:14,230 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1242 transitions. [2024-11-12 03:26:14,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1242 transitions. [2024-11-12 03:26:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 03:26:14,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:14,233 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:14,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:26:14,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:14,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash -517366854, now seen corresponding path program 1 times [2024-11-12 03:26:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058624550] [2024-11-12 03:26:14,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058624550] [2024-11-12 03:26:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058624550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:14,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:14,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:26:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729961984] [2024-11-12 03:26:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:14,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:26:14,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:26:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:26:14,569 INFO L87 Difference]: Start difference. First operand 818 states and 1242 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:14,922 INFO L93 Difference]: Finished difference Result 1564 states and 2365 transitions. [2024-11-12 03:26:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:26:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-12 03:26:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:14,931 INFO L225 Difference]: With dead ends: 1564 [2024-11-12 03:26:14,931 INFO L226 Difference]: Without dead ends: 880 [2024-11-12 03:26:14,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:26:14,937 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 249 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:14,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 226 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:26:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-12 03:26:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 697. [2024-11-12 03:26:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 515 states have (on average 1.396116504854369) internal successors, (719), 520 states have internal predecessors, (719), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-12 03:26:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1057 transitions. [2024-11-12 03:26:15,019 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1057 transitions. Word has length 137 [2024-11-12 03:26:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:15,019 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1057 transitions. [2024-11-12 03:26:15,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1057 transitions. [2024-11-12 03:26:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-12 03:26:15,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:15,021 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:15,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:26:15,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:15,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2105714756, now seen corresponding path program 1 times [2024-11-12 03:26:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:15,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445051240] [2024-11-12 03:26:15,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445051240] [2024-11-12 03:26:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445051240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:15,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:15,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:26:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723231554] [2024-11-12 03:26:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:15,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:26:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:26:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:26:15,461 INFO L87 Difference]: Start difference. First operand 697 states and 1057 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:15,912 INFO L93 Difference]: Finished difference Result 1515 states and 2294 transitions. [2024-11-12 03:26:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:26:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-12 03:26:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:15,919 INFO L225 Difference]: With dead ends: 1515 [2024-11-12 03:26:15,919 INFO L226 Difference]: Without dead ends: 821 [2024-11-12 03:26:15,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:26:15,922 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 346 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:15,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 418 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:26:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-12 03:26:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 697. [2024-11-12 03:26:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 515 states have (on average 1.3941747572815535) internal successors, (718), 520 states have internal predecessors, (718), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-12 03:26:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1056 transitions. [2024-11-12 03:26:15,990 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1056 transitions. Word has length 137 [2024-11-12 03:26:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:15,991 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1056 transitions. [2024-11-12 03:26:15,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1056 transitions. [2024-11-12 03:26:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 03:26:15,994 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:15,994 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:15,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 03:26:15,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:15,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:15,995 INFO L85 PathProgramCache]: Analyzing trace with hash -288892625, now seen corresponding path program 1 times [2024-11-12 03:26:15,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:15,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367370247] [2024-11-12 03:26:15,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:16,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:16,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367370247] [2024-11-12 03:26:16,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367370247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:16,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:16,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:26:16,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793146043] [2024-11-12 03:26:16,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:16,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:26:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:16,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:26:16,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:26:16,198 INFO L87 Difference]: Start difference. First operand 697 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:16,579 INFO L93 Difference]: Finished difference Result 1541 states and 2332 transitions. [2024-11-12 03:26:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:26:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-12 03:26:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:16,585 INFO L225 Difference]: With dead ends: 1541 [2024-11-12 03:26:16,586 INFO L226 Difference]: Without dead ends: 847 [2024-11-12 03:26:16,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:26:16,589 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 293 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:16,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 316 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:26:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-12 03:26:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 834. [2024-11-12 03:26:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 610 states have (on average 1.383606557377049) internal successors, (844), 616 states have internal predecessors, (844), 207 states have call successors, (207), 16 states have call predecessors, (207), 16 states have return successors, (207), 201 states have call predecessors, (207), 207 states have call successors, (207) [2024-11-12 03:26:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1258 transitions. [2024-11-12 03:26:16,661 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1258 transitions. Word has length 138 [2024-11-12 03:26:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:16,662 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1258 transitions. [2024-11-12 03:26:16,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1258 transitions. [2024-11-12 03:26:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-12 03:26:16,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:16,664 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:16,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 03:26:16,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:16,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:16,665 INFO L85 PathProgramCache]: Analyzing trace with hash -226853011, now seen corresponding path program 1 times [2024-11-12 03:26:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:16,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114456835] [2024-11-12 03:26:16,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114456835] [2024-11-12 03:26:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114456835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:26:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513113222] [2024-11-12 03:26:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:26:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:26:16,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:16,770 INFO L87 Difference]: Start difference. First operand 834 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:16,891 INFO L93 Difference]: Finished difference Result 1496 states and 2256 transitions. [2024-11-12 03:26:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:26:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-12 03:26:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:16,897 INFO L225 Difference]: With dead ends: 1496 [2024-11-12 03:26:16,897 INFO L226 Difference]: Without dead ends: 786 [2024-11-12 03:26:16,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-12 03:26:16,900 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 114 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:16,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 245 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:26:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-12 03:26:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2024-11-12 03:26:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 570 states have (on average 1.368421052631579) internal successors, (780), 576 states have internal predecessors, (780), 199 states have call successors, (199), 14 states have call predecessors, (199), 14 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2024-11-12 03:26:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1178 transitions. [2024-11-12 03:26:16,965 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1178 transitions. Word has length 138 [2024-11-12 03:26:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:16,966 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1178 transitions. [2024-11-12 03:26:16,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1178 transitions. [2024-11-12 03:26:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 03:26:16,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:16,968 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:16,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 03:26:16,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:16,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1010175940, now seen corresponding path program 1 times [2024-11-12 03:26:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:16,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108329731] [2024-11-12 03:26:16,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:16,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:26:17,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016313498] [2024-11-12 03:26:17,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:17,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:17,015 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-12 03:26:17,019 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-12 03:26:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 03:26:17,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:26:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:18,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:26:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108329731] [2024-11-12 03:26:18,029 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:26:18,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016313498] [2024-11-12 03:26:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016313498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:18,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:18,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:26:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872256608] [2024-11-12 03:26:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:26:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:26:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:26:18,031 INFO L87 Difference]: Start difference. First operand 784 states and 1178 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:19,043 INFO L93 Difference]: Finished difference Result 2770 states and 4159 transitions. [2024-11-12 03:26:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:26:19,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-12 03:26:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:19,056 INFO L225 Difference]: With dead ends: 2770 [2024-11-12 03:26:19,057 INFO L226 Difference]: Without dead ends: 2110 [2024-11-12 03:26:19,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:26:19,061 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 428 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:19,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 725 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:26:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2024-11-12 03:26:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1568. [2024-11-12 03:26:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1141 states have (on average 1.3567046450482034) internal successors, (1548), 1153 states have internal predecessors, (1548), 398 states have call successors, (398), 28 states have call predecessors, (398), 28 states have return successors, (398), 386 states have call predecessors, (398), 398 states have call successors, (398) [2024-11-12 03:26:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2344 transitions. [2024-11-12 03:26:19,218 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2344 transitions. Word has length 139 [2024-11-12 03:26:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:19,218 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2344 transitions. [2024-11-12 03:26:19,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2344 transitions. [2024-11-12 03:26:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 03:26:19,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:19,221 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:19,240 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-12 03:26:19,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:19,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:19,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash -309111362, now seen corresponding path program 1 times [2024-11-12 03:26:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:19,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302148306] [2024-11-12 03:26:19,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:26:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205730537] [2024-11-12 03:26:19,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:19,466 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-12 03:26:19,467 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-12 03:26:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:19,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 03:26:19,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:26:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:19,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:26:19,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:19,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302148306] [2024-11-12 03:26:19,868 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:26:19,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205730537] [2024-11-12 03:26:19,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205730537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:19,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:19,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:26:19,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619057567] [2024-11-12 03:26:19,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:19,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:26:19,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:26:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:26:19,870 INFO L87 Difference]: Start difference. First operand 1568 states and 2344 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:20,857 INFO L93 Difference]: Finished difference Result 6033 states and 9069 transitions. [2024-11-12 03:26:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 03:26:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-12 03:26:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:20,883 INFO L225 Difference]: With dead ends: 6033 [2024-11-12 03:26:20,883 INFO L226 Difference]: Without dead ends: 4468 [2024-11-12 03:26:20,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:26:20,891 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 361 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:20,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1154 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 03:26:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2024-11-12 03:26:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 3528. [2024-11-12 03:26:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 2526 states have (on average 1.3365003958828188) internal successors, (3376), 2554 states have internal predecessors, (3376), 935 states have call successors, (935), 66 states have call predecessors, (935), 66 states have return successors, (935), 907 states have call predecessors, (935), 935 states have call successors, (935) [2024-11-12 03:26:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 5246 transitions. [2024-11-12 03:26:21,312 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 5246 transitions. Word has length 139 [2024-11-12 03:26:21,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:21,313 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 5246 transitions. [2024-11-12 03:26:21,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5246 transitions. [2024-11-12 03:26:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 03:26:21,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:21,315 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:21,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 03:26:21,516 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,SelfDestructingSolverStorable9 [2024-11-12 03:26:21,516 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:21,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash -794234149, now seen corresponding path program 1 times [2024-11-12 03:26:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357295126] [2024-11-12 03:26:21,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:21,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:21,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357295126] [2024-11-12 03:26:21,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357295126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:21,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:21,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:26:21,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774043304] [2024-11-12 03:26:21,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:21,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:26:21,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:21,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:26:21,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:26:21,770 INFO L87 Difference]: Start difference. First operand 3528 states and 5246 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:22,250 INFO L93 Difference]: Finished difference Result 6894 states and 10284 transitions. [2024-11-12 03:26:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:26:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-12 03:26:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:22,277 INFO L225 Difference]: With dead ends: 6894 [2024-11-12 03:26:22,277 INFO L226 Difference]: Without dead ends: 4156 [2024-11-12 03:26:22,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:26:22,288 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 114 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:22,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 254 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:26:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2024-11-12 03:26:22,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 4113. [2024-11-12 03:26:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4113 states, 2951 states have (on average 1.3381904439173162) internal successors, (3949), 2984 states have internal predecessors, (3949), 1085 states have call successors, (1085), 76 states have call predecessors, (1085), 76 states have return successors, (1085), 1052 states have call predecessors, (1085), 1085 states have call successors, (1085) [2024-11-12 03:26:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 6119 transitions. [2024-11-12 03:26:22,667 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 6119 transitions. Word has length 139 [2024-11-12 03:26:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:22,668 INFO L471 AbstractCegarLoop]: Abstraction has 4113 states and 6119 transitions. [2024-11-12 03:26:22,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 6119 transitions. [2024-11-12 03:26:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 03:26:22,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:22,671 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:22,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 03:26:22,671 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:22,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash -371532323, now seen corresponding path program 1 times [2024-11-12 03:26:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:22,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112488990] [2024-11-12 03:26:22,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:22,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:23,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:23,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112488990] [2024-11-12 03:26:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112488990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:26:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132373535] [2024-11-12 03:26:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:26:23,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:26:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:26:23,345 INFO L87 Difference]: Start difference. First operand 4113 states and 6119 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:24,033 INFO L93 Difference]: Finished difference Result 5550 states and 8261 transitions. [2024-11-12 03:26:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:26:24,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-12 03:26:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:24,062 INFO L225 Difference]: With dead ends: 5550 [2024-11-12 03:26:24,062 INFO L226 Difference]: Without dead ends: 3633 [2024-11-12 03:26:24,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:26:24,072 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 330 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:24,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 486 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:26:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2024-11-12 03:26:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3625. [2024-11-12 03:26:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2591 states have (on average 1.3342338865302972) internal successors, (3457), 2620 states have internal predecessors, (3457), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-12 03:26:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5387 transitions. [2024-11-12 03:26:24,443 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5387 transitions. Word has length 139 [2024-11-12 03:26:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:24,444 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5387 transitions. [2024-11-12 03:26:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5387 transitions. [2024-11-12 03:26:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 03:26:24,447 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:24,447 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 03:26:24,447 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash -822195952, now seen corresponding path program 1 times [2024-11-12 03:26:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573809612] [2024-11-12 03:26:24,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:26:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1725275401] [2024-11-12 03:26:24,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:24,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:24,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:26:24,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 03:26:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:24,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 03:26:24,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:26:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:25,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:26:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573809612] [2024-11-12 03:26:25,119 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 03:26:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725275401] [2024-11-12 03:26:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725275401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:25,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:25,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:26:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342124136] [2024-11-12 03:26:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:25,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:26:25,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:25,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:26:25,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:26:25,144 INFO L87 Difference]: Start difference. First operand 3625 states and 5387 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:26,098 INFO L93 Difference]: Finished difference Result 4555 states and 6767 transitions. [2024-11-12 03:26:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:26:26,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-12 03:26:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:26,123 INFO L225 Difference]: With dead ends: 4555 [2024-11-12 03:26:26,124 INFO L226 Difference]: Without dead ends: 3896 [2024-11-12 03:26:26,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-12 03:26:26,130 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 467 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:26,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1002 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 03:26:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2024-11-12 03:26:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3637. [2024-11-12 03:26:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3637 states, 2603 states have (on average 1.3357664233576643) internal successors, (3477), 2632 states have internal predecessors, (3477), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-12 03:26:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 5407 transitions. [2024-11-12 03:26:26,453 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 5407 transitions. Word has length 140 [2024-11-12 03:26:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:26,454 INFO L471 AbstractCegarLoop]: Abstraction has 3637 states and 5407 transitions. [2024-11-12 03:26:26,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 5407 transitions. [2024-11-12 03:26:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 03:26:26,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:26,456 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:26,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 03:26:26,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:26,658 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:26,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:26,658 INFO L85 PathProgramCache]: Analyzing trace with hash -747749173, now seen corresponding path program 1 times [2024-11-12 03:26:26,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:26,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097768140] [2024-11-12 03:26:26,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:26:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 03:26:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 03:26:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 03:26:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:26:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 03:26:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:26:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 03:26:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:26:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:26,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097768140] [2024-11-12 03:26:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097768140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:26:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959162818] [2024-11-12 03:26:26,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:26,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:26:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:26:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:26,766 INFO L87 Difference]: Start difference. First operand 3637 states and 5407 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:27,131 INFO L93 Difference]: Finished difference Result 8813 states and 13013 transitions. [2024-11-12 03:26:27,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:26:27,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-12 03:26:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:27,169 INFO L225 Difference]: With dead ends: 8813 [2024-11-12 03:26:27,170 INFO L226 Difference]: Without dead ends: 5179 [2024-11-12 03:26:27,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-12 03:26:27,185 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:27,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 229 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:26:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2024-11-12 03:26:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 4484. [2024-11-12 03:26:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4484 states, 3450 states have (on average 1.3620289855072463) internal successors, (4699), 3479 states have internal predecessors, (4699), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-12 03:26:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6629 transitions. [2024-11-12 03:26:27,603 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6629 transitions. Word has length 140 [2024-11-12 03:26:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:27,603 INFO L471 AbstractCegarLoop]: Abstraction has 4484 states and 6629 transitions. [2024-11-12 03:26:27,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6629 transitions. [2024-11-12 03:26:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-12 03:26:27,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:27,606 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:27,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 03:26:27,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:27,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash -67690803, now seen corresponding path program 1 times [2024-11-12 03:26:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:27,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256208006] [2024-11-12 03:26:27,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:26:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803584229] [2024-11-12 03:26:27,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:27,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:27,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:27,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:26:27,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 03:26:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:26:27,820 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:26:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:26:27,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:26:27,982 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:26:27,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:26:28,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 03:26:28,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 03:26:28,190 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:28,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:26:28,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:26:28 BoogieIcfgContainer [2024-11-12 03:26:28,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:26:28,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:26:28,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:26:28,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:26:28,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:10" (3/4) ... [2024-11-12 03:26:28,326 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:26:28,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:26:28,327 INFO L158 Benchmark]: Toolchain (without parser) took 19292.44ms. Allocated memory was 192.9MB in the beginning and 746.6MB in the end (delta: 553.6MB). Free memory was 123.0MB in the beginning and 313.3MB in the end (delta: -190.3MB). Peak memory consumption was 365.3MB. Max. memory is 16.1GB. [2024-11-12 03:26:28,327 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 192.9MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:26:28,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.21ms. Allocated memory is still 192.9MB. Free memory was 122.9MB in the beginning and 156.1MB in the end (delta: -33.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-12 03:26:28,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.18ms. Allocated memory is still 192.9MB. Free memory was 155.9MB in the beginning and 151.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:26:28,328 INFO L158 Benchmark]: Boogie Preprocessor took 90.57ms. Allocated memory is still 192.9MB. Free memory was 151.7MB in the beginning and 146.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:26:28,328 INFO L158 Benchmark]: RCFGBuilder took 634.23ms. Allocated memory is still 192.9MB. Free memory was 146.6MB in the beginning and 118.3MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 03:26:28,329 INFO L158 Benchmark]: TraceAbstraction took 18015.00ms. Allocated memory was 192.9MB in the beginning and 746.6MB in the end (delta: 553.6MB). Free memory was 117.2MB in the beginning and 313.3MB in the end (delta: -196.1MB). Peak memory consumption was 359.4MB. Max. memory is 16.1GB. [2024-11-12 03:26:28,329 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 746.6MB. Free memory is still 313.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:26:28,330 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.20ms. Allocated memory is still 192.9MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.21ms. Allocated memory is still 192.9MB. Free memory was 122.9MB in the beginning and 156.1MB in the end (delta: -33.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.18ms. Allocated memory is still 192.9MB. Free memory was 155.9MB in the beginning and 151.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.57ms. Allocated memory is still 192.9MB. Free memory was 151.7MB in the beginning and 146.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 634.23ms. Allocated memory is still 192.9MB. Free memory was 146.6MB in the beginning and 118.3MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18015.00ms. Allocated memory was 192.9MB in the beginning and 746.6MB in the end (delta: 553.6MB). Free memory was 117.2MB in the beginning and 313.3MB in the end (delta: -196.1MB). Peak memory consumption was 359.4MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 746.6MB. Free memory is still 313.3MB. 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 180, overapproximation of someBinaryFLOATComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double var_1_21 = 63.25; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] signed long int var_1_27 = 0; [L42] signed short int var_1_29 = 2; [L43] unsigned char var_1_31 = 1; [L44] signed long int var_1_32 = 32; [L45] signed long int var_1_34 = 0; [L46] unsigned char var_1_37 = 1; [L47] unsigned long int var_1_38 = 16; [L48] unsigned char var_1_39 = 0; [L49] unsigned char var_1_40 = 0; [L50] double last_1_var_1_1 = 256.5; [L51] float last_1_var_1_8 = 5.25; [L52] signed long int last_1_var_1_11 = 4; [L53] unsigned short int last_1_var_1_14 = 10000; [L54] unsigned short int last_1_var_1_17 = 4; [L55] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_17 = var_1_17 [L177] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L143] var_1_3 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L144] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L145] var_1_4 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L146] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L147] var_1_5 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L148] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L152] var_1_16 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L153] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L155] var_1_19 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L156] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L161] var_1_25 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L162] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L165] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L167] var_1_40 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L168] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L188] RET updateVariables() [L189] CALL step() [L59] COND FALSE !(\read(var_1_2)) [L68] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L70] COND TRUE var_1_17 == var_1_18 [L71] var_1_31 = (! var_1_26) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L73] COND TRUE var_1_16 < var_1_11 [L74] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR var_1_18 & var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR (var_1_18 & var_1_17) & var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] COND TRUE ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) <= ((var_1_18 & var_1_17) & var_1_18) [L85] var_1_38 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L87] COND TRUE ! var_1_2 [L88] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L92] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L97] var_1_27 = var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L98] COND TRUE var_1_20 < var_1_17 [L99] var_1_39 = (! (var_1_26 && var_1_40)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L101] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L105] var_1_29 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L106] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L113] COND TRUE var_1_4 <= last_1_var_1_1 [L114] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L118] var_1_21 = var_1_5 [L119] var_1_37 = (var_1_2 && var_1_25) [L120] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L121] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L122] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L126] COND FALSE !(var_1_4 < (- var_1_5)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L133] COND FALSE !(var_1_20 < ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L180-L181] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 15, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3523 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3523 mSDsluCounter, 6545 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4150 mSDsCounter, 646 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3864 IncrementalHoareTripleChecker+Invalid, 4510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 646 mSolverCounterUnsat, 2395 mSDtfsCounter, 3864 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4484occurred in iteration=14, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 2826 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2632 NumberOfCodeBlocks, 2632 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 6746 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1083 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 9576/9576 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-12 03:26:28,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercodestructure_filler-pr-ci_file-76.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 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:26:30,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:26:30,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:26:30,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:26:30,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:26:30,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:26:30,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:26:30,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:26:30,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:26:30,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:26:30,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:26:30,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:26:30,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:26:30,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:26:30,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:26:30,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:26:30,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:26:30,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:26:30,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:26:30,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:26:30,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:26:30,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:26:30,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:26:30,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:26:30,650 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:26:30,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:26:30,651 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:26:30,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:26:30,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:26:30,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:26:30,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:26:30,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:26:30,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:26:30,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:26:30,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:30,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:26:30,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:26:30,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:26:30,655 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:26:30,655 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:26:30,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:26:30,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:26:30,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:26:30,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:26:30,660 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 -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2024-11-12 03:26:30,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:26:31,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:26:31,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:26:31,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:26:31,023 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:26:31,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-12 03:26:32,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:26:32,759 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:26:32,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-12 03:26:32,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe59a60e/b9deed5962d44e68aad2eeb1b01139fb/FLAG322b2f0a2 [2024-11-12 03:26:32,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe59a60e/b9deed5962d44e68aad2eeb1b01139fb [2024-11-12 03:26:32,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:26:32,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:26:32,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:32,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:26:32,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:26:32,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:32" (1/1) ... [2024-11-12 03:26:32,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b22d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:32, skipping insertion in model container [2024-11-12 03:26:32,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:32" (1/1) ... [2024-11-12 03:26:32,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:26:33,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-11-12 03:26:33,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:33,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:26:33,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-11-12 03:26:33,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:33,216 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:26:33,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33 WrapperNode [2024-11-12 03:26:33,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:33,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:33,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:26:33,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:26:33,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,278 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-12 03:26:33,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:33,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:26:33,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:26:33,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:26:33,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,337 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-12 03:26:33,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:26:33,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:26:33,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:26:33,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:26:33,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (1/1) ... [2024-11-12 03:26:33,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:33,410 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-12 03:26:33,413 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-12 03:26:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:26:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:26:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:26:33,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:26:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:26:33,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:26:33,563 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:26:33,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:26:43,590 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 03:26:43,591 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:26:43,605 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:26:43,606 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:26:43,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:43 BoogieIcfgContainer [2024-11-12 03:26:43,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:26:43,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:26:43,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:26:43,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:26:43,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:26:32" (1/3) ... [2024-11-12 03:26:43,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dc0a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:43, skipping insertion in model container [2024-11-12 03:26:43,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:33" (2/3) ... [2024-11-12 03:26:43,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52dc0a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:43, skipping insertion in model container [2024-11-12 03:26:43,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:43" (3/3) ... [2024-11-12 03:26:43,615 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-12 03:26:43,630 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:26:43,631 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:26:43,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:26:43,698 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;@77fe738e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:26:43,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:26:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 03:26:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 03:26:43,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:43,718 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:43,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:43,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1793733614, now seen corresponding path program 1 times [2024-11-12 03:26:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:26:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897199267] [2024-11-12 03:26:43,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:43,738 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-12 03:26:43,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:26:43,742 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-12 03:26:43,743 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-12 03:26:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:44,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 03:26:44,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:26:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:26:47,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:26:47,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:26:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897199267] [2024-11-12 03:26:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897199267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:47,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:26:47,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967696211] [2024-11-12 03:26:47,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:47,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:26:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:26:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:26:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:47,620 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:52,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:26:56,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:26:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:56,028 INFO L93 Difference]: Finished difference Result 209 states and 376 transitions. [2024-11-12 03:26:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:26:56,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 132 [2024-11-12 03:26:56,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:56,126 INFO L225 Difference]: With dead ends: 209 [2024-11-12 03:26:56,126 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 03:26:56,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 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-12 03:26:56,133 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 40 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:56,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-11-12 03:26:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 03:26:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-11-12 03:26:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-12 03:26:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2024-11-12 03:26:56,199 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 132 [2024-11-12 03:26:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:56,200 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2024-11-12 03:26:56,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:26:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2024-11-12 03:26:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 03:26:56,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:56,204 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:56,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:26:56,405 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-12 03:26:56,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:56,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2051899052, now seen corresponding path program 1 times [2024-11-12 03:26:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:26:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025481444] [2024-11-12 03:26:56,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:56,408 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-12 03:26:56,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:26:56,413 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-12 03:26:56,415 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-12 03:26:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:57,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 03:26:57,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 03:27:06,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:27:06,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:27:06,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025481444] [2024-11-12 03:27:06,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025481444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:27:06,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:27:06,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:27:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986112260] [2024-11-12 03:27:06,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:27:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:27:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:27:06,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:27:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:27:06,902 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 03:27:15,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:27:19,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:27:23,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:27:27,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []