./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-pe-co_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 52dba7ee3ed26d722934af1549d91288e4a47bd5e304fc15e1e16045abb80069 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:35:49,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:35:50,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:35:50,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:35:50,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:35:50,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:35:50,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:35:50,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:35:50,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:35:50,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:35:50,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:35:50,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:35:50,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:35:50,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:35:50,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:35:50,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:35:50,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:35:50,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:35:50,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:35:50,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:35:50,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:35:50,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:35:50,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:35:50,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:35:50,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:35:50,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:35:50,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:35:50,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:35:50,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:35:50,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:35:50,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:35:50,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:35:50,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:35:50,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:35:50,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:35:50,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:35:50,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:35:50,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:35:50,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:35:50,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:35:50,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:35:50,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:35:50,060 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 -> 52dba7ee3ed26d722934af1549d91288e4a47bd5e304fc15e1e16045abb80069 [2024-11-08 21:35:50,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:35:50,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:35:50,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:35:50,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:35:50,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:35:50,373 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-pe-co_file-76.i [2024-11-08 21:35:51,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:35:52,084 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:35:52,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-76.i [2024-11-08 21:35:52,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632494ae6/7b7181fa87f748c1bbbe9d10d3d09a95/FLAG71754b296 [2024-11-08 21:35:52,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632494ae6/7b7181fa87f748c1bbbe9d10d3d09a95 [2024-11-08 21:35:52,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:35:52,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:35:52,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:35:52,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:35:52,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:35:52,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7fb613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52, skipping insertion in model container [2024-11-08 21:35:52,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:35:52,317 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-pe-co_file-76.i[919,932] [2024-11-08 21:35:52,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:35:52,400 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:35:52,412 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-pe-co_file-76.i[919,932] [2024-11-08 21:35:52,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:35:52,494 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:35:52,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52 WrapperNode [2024-11-08 21:35:52,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:35:52,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:35:52,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:35:52,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:35:52,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,568 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2024-11-08 21:35:52,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:35:52,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:35:52,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:35:52,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:35:52,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,615 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-08 21:35:52,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:35:52,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:35:52,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:35:52,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:35:52,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (1/1) ... [2024-11-08 21:35:52,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:35:52,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:35:52,691 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-08 21:35:52,698 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-08 21:35:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:35:52,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:35:52,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:35:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:35:52,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:35:52,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:35:52,861 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:35:52,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:35:53,418 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 21:35:53,419 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:35:53,438 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:35:53,438 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:35:53,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:35:53 BoogieIcfgContainer [2024-11-08 21:35:53,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:35:53,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:35:53,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:35:53,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:35:53,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:35:52" (1/3) ... [2024-11-08 21:35:53,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4475f296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:35:53, skipping insertion in model container [2024-11-08 21:35:53,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:35:52" (2/3) ... [2024-11-08 21:35:53,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4475f296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:35:53, skipping insertion in model container [2024-11-08 21:35:53,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:35:53" (3/3) ... [2024-11-08 21:35:53,450 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-76.i [2024-11-08 21:35:53,467 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:35:53,467 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:35:53,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:35:53,542 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;@8c419d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:35:53,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:35:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 72 states have internal predecessors, (107), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 21:35:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 21:35:53,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:53,567 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:53,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash -991090176, now seen corresponding path program 1 times [2024-11-08 21:35:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218309781] [2024-11-08 21:35:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:35:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:35:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:35:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:53,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:35:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:35:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:35:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:35:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:35:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218309781] [2024-11-08 21:35:54,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218309781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:35:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115924875] [2024-11-08 21:35:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:54,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:35:54,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:54,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:35:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:35:54,118 INFO L87 Difference]: Start difference. First operand has 96 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 72 states have internal predecessors, (107), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 21:35:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:54,147 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2024-11-08 21:35:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:35:54,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2024-11-08 21:35:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:54,160 INFO L225 Difference]: With dead ends: 180 [2024-11-08 21:35:54,160 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 21:35:54,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-08 21:35:54,166 INFO L432 NwaCegarLoop]: 133 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, 133 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-08 21:35:54,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:35:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 21:35:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 21:35:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 21:35:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2024-11-08 21:35:54,215 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 155 [2024-11-08 21:35:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:54,216 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-11-08 21:35:54,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 21:35:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-11-08 21:35:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 21:35:54,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:54,220 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:54,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:35:54,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:54,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash -179718328, now seen corresponding path program 1 times [2024-11-08 21:35:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610422972] [2024-11-08 21:35:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:35:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:35:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:35:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:35:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:35:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:35:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:35:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:35:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610422972] [2024-11-08 21:35:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610422972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:54,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:35:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961629081] [2024-11-08 21:35:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:54,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:35:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:35:54,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:35:54,857 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:55,096 INFO L93 Difference]: Finished difference Result 255 states and 393 transitions. [2024-11-08 21:35:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:35:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-08 21:35:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:55,105 INFO L225 Difference]: With dead ends: 255 [2024-11-08 21:35:55,105 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 21:35:55,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-08 21:35:55,107 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 87 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:55,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 331 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:35:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 21:35:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-11-08 21:35:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 122 states have (on average 1.4180327868852458) internal successors, (173), 122 states have internal predecessors, (173), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 21:35:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 261 transitions. [2024-11-08 21:35:55,164 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 261 transitions. Word has length 155 [2024-11-08 21:35:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:55,164 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 261 transitions. [2024-11-08 21:35:55,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 261 transitions. [2024-11-08 21:35:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 21:35:55,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:55,171 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:55,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:35:55,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:55,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:55,173 INFO L85 PathProgramCache]: Analyzing trace with hash 39136390, now seen corresponding path program 1 times [2024-11-08 21:35:55,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:55,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36801959] [2024-11-08 21:35:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:35:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:35:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:35:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:35:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:35:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:35:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:35:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:35:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36801959] [2024-11-08 21:35:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36801959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:55,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:55,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:35:55,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348034556] [2024-11-08 21:35:55,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:55,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:35:55,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:55,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:35:55,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:35:55,666 INFO L87 Difference]: Start difference. First operand 169 states and 261 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:55,837 INFO L93 Difference]: Finished difference Result 419 states and 649 transitions. [2024-11-08 21:35:55,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:35:55,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-08 21:35:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:55,841 INFO L225 Difference]: With dead ends: 419 [2024-11-08 21:35:55,841 INFO L226 Difference]: Without dead ends: 253 [2024-11-08 21:35:55,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 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-08 21:35:55,843 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 126 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:55,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 313 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:35:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-08 21:35:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2024-11-08 21:35:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 181 states have (on average 1.4143646408839778) internal successors, (256), 181 states have internal predecessors, (256), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 21:35:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 388 transitions. [2024-11-08 21:35:55,887 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 388 transitions. Word has length 155 [2024-11-08 21:35:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:55,888 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 388 transitions. [2024-11-08 21:35:55,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 388 transitions. [2024-11-08 21:35:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 21:35:55,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:55,891 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:55,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:35:55,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:55,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1865295397, now seen corresponding path program 1 times [2024-11-08 21:35:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:55,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523767989] [2024-11-08 21:35:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:35:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:35:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:35:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:55,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:35:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:35:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:35:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:35:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:35:56,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:56,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523767989] [2024-11-08 21:35:56,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523767989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:56,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:56,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:35:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392849693] [2024-11-08 21:35:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:56,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:35:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:35:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:35:56,039 INFO L87 Difference]: Start difference. First operand 251 states and 388 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:56,156 INFO L93 Difference]: Finished difference Result 741 states and 1146 transitions. [2024-11-08 21:35:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:35:56,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-08 21:35:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:56,163 INFO L225 Difference]: With dead ends: 741 [2024-11-08 21:35:56,163 INFO L226 Difference]: Without dead ends: 493 [2024-11-08 21:35:56,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-08 21:35:56,167 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 120 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:56,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 211 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:35:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-08 21:35:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 488. [2024-11-08 21:35:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 349 states have (on average 1.3868194842406876) internal successors, (484), 349 states have internal predecessors, (484), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 21:35:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 748 transitions. [2024-11-08 21:35:56,247 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 748 transitions. Word has length 156 [2024-11-08 21:35:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:56,248 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 748 transitions. [2024-11-08 21:35:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 748 transitions. [2024-11-08 21:35:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 21:35:56,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:56,251 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:56,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:35:56,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:56,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1222246643, now seen corresponding path program 1 times [2024-11-08 21:35:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:56,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951441086] [2024-11-08 21:35:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:35:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:35:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:35:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:35:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:35:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:35:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:35:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:35:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:56,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951441086] [2024-11-08 21:35:56,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951441086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:56,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:56,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:35:56,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512708039] [2024-11-08 21:35:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:56,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:35:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:56,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:35:56,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:35:56,432 INFO L87 Difference]: Start difference. First operand 488 states and 748 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:56,568 INFO L93 Difference]: Finished difference Result 490 states and 749 transitions. [2024-11-08 21:35:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:35:56,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-08 21:35:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:56,573 INFO L225 Difference]: With dead ends: 490 [2024-11-08 21:35:56,573 INFO L226 Difference]: Without dead ends: 327 [2024-11-08 21:35:56,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-08 21:35:56,576 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 128 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:56,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 205 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:35:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-08 21:35:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 166. [2024-11-08 21:35:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 119 states have (on average 1.361344537815126) internal successors, (162), 119 states have internal predecessors, (162), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 21:35:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 250 transitions. [2024-11-08 21:35:56,603 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 250 transitions. Word has length 156 [2024-11-08 21:35:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:56,604 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 250 transitions. [2024-11-08 21:35:56,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2024-11-08 21:35:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 21:35:56,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:56,606 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:56,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:35:56,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2052109251, now seen corresponding path program 1 times [2024-11-08 21:35:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796229411] [2024-11-08 21:35:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:35:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:35:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:35:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:35:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:35:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:35:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:35:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:35:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:56,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796229411] [2024-11-08 21:35:56,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796229411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:56,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:56,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:35:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939681690] [2024-11-08 21:35:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:56,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:35:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:35:56,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:35:56,819 INFO L87 Difference]: Start difference. First operand 166 states and 250 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:56,965 INFO L93 Difference]: Finished difference Result 331 states and 501 transitions. [2024-11-08 21:35:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:35:56,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-08 21:35:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:56,967 INFO L225 Difference]: With dead ends: 331 [2024-11-08 21:35:56,970 INFO L226 Difference]: Without dead ends: 168 [2024-11-08 21:35:56,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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-08 21:35:56,971 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 127 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:56,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 168 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:35:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-08 21:35:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-08 21:35:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 121 states have internal predecessors, (164), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 21:35:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2024-11-08 21:35:56,995 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 157 [2024-11-08 21:35:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:56,995 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2024-11-08 21:35:56,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2024-11-08 21:35:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 21:35:56,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:56,998 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:56,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:35:56,998 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:56,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:56,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1242762625, now seen corresponding path program 1 times [2024-11-08 21:35:56,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:56,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627359628] [2024-11-08 21:35:56,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:56,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:35:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:35:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:35:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:35:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:35:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:35:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:35:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:35:57,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627359628] [2024-11-08 21:35:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627359628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:57,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:57,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:35:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673974897] [2024-11-08 21:35:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:57,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:35:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:57,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:35:57,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:35:57,429 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:57,885 INFO L93 Difference]: Finished difference Result 605 states and 895 transitions. [2024-11-08 21:35:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:35:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-08 21:35:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:57,889 INFO L225 Difference]: With dead ends: 605 [2024-11-08 21:35:57,889 INFO L226 Difference]: Without dead ends: 440 [2024-11-08 21:35:57,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:35:57,890 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 519 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:57,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 493 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:35:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-08 21:35:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 266. [2024-11-08 21:35:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 196 states have internal predecessors, (268), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 21:35:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 400 transitions. [2024-11-08 21:35:57,949 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 400 transitions. Word has length 157 [2024-11-08 21:35:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:57,950 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 400 transitions. [2024-11-08 21:35:57,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 400 transitions. [2024-11-08 21:35:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 21:35:57,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:57,953 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:57,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:35:57,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:57,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 221694271, now seen corresponding path program 1 times [2024-11-08 21:35:57,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:57,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432502058] [2024-11-08 21:35:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:35:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:35:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:35:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:35:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:35:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:35:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:35:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:35:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:35:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:35:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:35:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:35:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:35:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:35:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:35:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:35:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:35:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:35:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:35:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:35:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:35:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:35:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:35:58,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:35:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432502058] [2024-11-08 21:35:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432502058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:35:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:35:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:35:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469922114] [2024-11-08 21:35:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:35:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:35:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:35:58,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:35:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:35:58,533 INFO L87 Difference]: Start difference. First operand 266 states and 400 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:35:58,721 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2024-11-08 21:35:58,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:35:58,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-08 21:35:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:35:58,751 INFO L225 Difference]: With dead ends: 529 [2024-11-08 21:35:58,751 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 21:35:58,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:35:58,752 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:35:58,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 101 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:35:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 21:35:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-08 21:35:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 196 states have (on average 1.3520408163265305) internal successors, (265), 196 states have internal predecessors, (265), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-08 21:35:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 397 transitions. [2024-11-08 21:35:58,793 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 397 transitions. Word has length 157 [2024-11-08 21:35:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:35:58,794 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 397 transitions. [2024-11-08 21:35:58,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:35:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 397 transitions. [2024-11-08 21:35:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 21:35:58,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:35:58,796 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:35:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:35:58,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:35:58,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:35:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1996701633, now seen corresponding path program 1 times [2024-11-08 21:35:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:35:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853758721] [2024-11-08 21:35:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:35:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:35:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546106737] [2024-11-08 21:35:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:35:58,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:35:58,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:35:58,868 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-08 21:35:58,869 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-08 21:35:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:35:59,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 21:35:59,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:36:00,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:36:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:36:00,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853758721] [2024-11-08 21:36:00,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:36:00,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546106737] [2024-11-08 21:36:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546106737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:00,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:36:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095563651] [2024-11-08 21:36:00,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:00,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:36:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:36:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:36:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:36:00,181 INFO L87 Difference]: Start difference. First operand 266 states and 397 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:00,835 INFO L93 Difference]: Finished difference Result 697 states and 1035 transitions. [2024-11-08 21:36:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:36:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-08 21:36:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:00,839 INFO L225 Difference]: With dead ends: 697 [2024-11-08 21:36:00,839 INFO L226 Difference]: Without dead ends: 434 [2024-11-08 21:36:00,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:36:00,841 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 353 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:00,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 591 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:36:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-08 21:36:00,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 354. [2024-11-08 21:36:00,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 261 states have (on average 1.3448275862068966) internal successors, (351), 261 states have internal predecessors, (351), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-08 21:36:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 527 transitions. [2024-11-08 21:36:00,913 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 527 transitions. Word has length 157 [2024-11-08 21:36:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:00,914 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 527 transitions. [2024-11-08 21:36:00,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 527 transitions. [2024-11-08 21:36:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 21:36:00,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:00,916 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:00,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:36:01,117 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-08 21:36:01,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:01,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1058342591, now seen corresponding path program 1 times [2024-11-08 21:36:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:36:01,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149896821] [2024-11-08 21:36:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:36:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:36:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:36:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:36:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:36:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:36:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:36:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:36:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:36:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:36:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:36:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:36:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:36:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:36:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:36:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:36:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:36:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:36:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:36:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:36:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:36:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:36:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:36:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:36:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:36:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149896821] [2024-11-08 21:36:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149896821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:01,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 21:36:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045178304] [2024-11-08 21:36:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:36:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:36:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:36:01,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:36:01,491 INFO L87 Difference]: Start difference. First operand 354 states and 527 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:02,210 INFO L93 Difference]: Finished difference Result 1391 states and 2053 transitions. [2024-11-08 21:36:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 21:36:02,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-08 21:36:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:02,216 INFO L225 Difference]: With dead ends: 1391 [2024-11-08 21:36:02,216 INFO L226 Difference]: Without dead ends: 1012 [2024-11-08 21:36:02,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:36:02,219 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 340 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:02,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 701 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:36:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-08 21:36:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 564. [2024-11-08 21:36:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 425 states have (on average 1.3741176470588234) internal successors, (584), 425 states have internal predecessors, (584), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 21:36:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 848 transitions. [2024-11-08 21:36:02,304 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 848 transitions. Word has length 157 [2024-11-08 21:36:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:02,304 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 848 transitions. [2024-11-08 21:36:02,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 848 transitions. [2024-11-08 21:36:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 21:36:02,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:02,307 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:02,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 21:36:02,307 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:02,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash -2079410945, now seen corresponding path program 1 times [2024-11-08 21:36:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:36:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534727049] [2024-11-08 21:36:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:36:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:36:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778143915] [2024-11-08 21:36:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:02,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:36:02,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:36:02,366 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-08 21:36:02,368 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-08 21:36:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:02,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 21:36:02,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:36:02,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:36:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:36:02,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534727049] [2024-11-08 21:36:02,837 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:36:02,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778143915] [2024-11-08 21:36:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778143915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:02,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:02,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:36:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143436508] [2024-11-08 21:36:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:02,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:36:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:36:02,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:36:02,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:36:02,839 INFO L87 Difference]: Start difference. First operand 564 states and 848 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:03,200 INFO L93 Difference]: Finished difference Result 1729 states and 2580 transitions. [2024-11-08 21:36:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:36:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-08 21:36:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:03,208 INFO L225 Difference]: With dead ends: 1729 [2024-11-08 21:36:03,208 INFO L226 Difference]: Without dead ends: 1168 [2024-11-08 21:36:03,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:36:03,211 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 263 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:03,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:36:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-11-08 21:36:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 568. [2024-11-08 21:36:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 429 states have (on average 1.3636363636363635) internal successors, (585), 429 states have internal predecessors, (585), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 21:36:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 849 transitions. [2024-11-08 21:36:03,288 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 849 transitions. Word has length 157 [2024-11-08 21:36:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:03,288 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 849 transitions. [2024-11-08 21:36:03,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 849 transitions. [2024-11-08 21:36:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 21:36:03,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:03,290 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:03,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:36:03,491 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,SelfDestructingSolverStorable10 [2024-11-08 21:36:03,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:03,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1030634636, now seen corresponding path program 1 times [2024-11-08 21:36:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:36:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86266281] [2024-11-08 21:36:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:36:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:36:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:36:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:36:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:36:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:36:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:36:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:36:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:36:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:36:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:36:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:36:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:36:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:36:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:36:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:36:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:36:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:36:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:36:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:36:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:36:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:36:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:36:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:36:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:36:03,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86266281] [2024-11-08 21:36:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86266281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:03,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:03,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:36:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313634915] [2024-11-08 21:36:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:03,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:36:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:36:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:36:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:36:03,592 INFO L87 Difference]: Start difference. First operand 568 states and 849 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:03,686 INFO L93 Difference]: Finished difference Result 1443 states and 2139 transitions. [2024-11-08 21:36:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:36:03,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-11-08 21:36:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:03,692 INFO L225 Difference]: With dead ends: 1443 [2024-11-08 21:36:03,693 INFO L226 Difference]: Without dead ends: 878 [2024-11-08 21:36:03,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-08 21:36:03,695 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 50 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:03,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 242 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:36:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-08 21:36:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 685. [2024-11-08 21:36:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 546 states have (on average 1.3663003663003663) internal successors, (746), 546 states have internal predecessors, (746), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-08 21:36:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1010 transitions. [2024-11-08 21:36:03,792 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1010 transitions. Word has length 158 [2024-11-08 21:36:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:03,793 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1010 transitions. [2024-11-08 21:36:03,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1010 transitions. [2024-11-08 21:36:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 21:36:03,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:03,795 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:03,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 21:36:03,795 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:03,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 212986186, now seen corresponding path program 1 times [2024-11-08 21:36:03,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:36:03,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263211103] [2024-11-08 21:36:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:03,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:36:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:36:03,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320327571] [2024-11-08 21:36:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:03,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:36:03,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:36:03,835 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-08 21:36:03,836 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-08 21:36:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:36:03,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:36:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:36:04,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:36:04,150 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:36:04,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:36:04,171 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-08 21:36:04,353 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-08 21:36:04,356 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:36:04,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:36:04,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:36:04 BoogieIcfgContainer [2024-11-08 21:36:04,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:36:04,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:36:04,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:36:04,481 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:36:04,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:35:53" (3/4) ... [2024-11-08 21:36:04,484 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:36:04,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:36:04,486 INFO L158 Benchmark]: Toolchain (without parser) took 12376.54ms. Allocated memory was 163.6MB in the beginning and 377.5MB in the end (delta: 213.9MB). Free memory was 108.4MB in the beginning and 239.2MB in the end (delta: -130.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-11-08 21:36:04,486 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:36:04,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.66ms. Allocated memory is still 163.6MB. Free memory was 108.4MB in the beginning and 91.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:36:04,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.73ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 86.6MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:36:04,487 INFO L158 Benchmark]: Boogie Preprocessor took 75.27ms. Allocated memory is still 163.6MB. Free memory was 86.6MB in the beginning and 81.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:36:04,487 INFO L158 Benchmark]: RCFGBuilder took 793.21ms. Allocated memory is still 163.6MB. Free memory was 81.6MB in the beginning and 115.8MB in the end (delta: -34.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:36:04,487 INFO L158 Benchmark]: TraceAbstraction took 11038.83ms. Allocated memory was 163.6MB in the beginning and 377.5MB in the end (delta: 213.9MB). Free memory was 114.9MB in the beginning and 239.2MB in the end (delta: -124.2MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. [2024-11-08 21:36:04,487 INFO L158 Benchmark]: Witness Printer took 4.57ms. Allocated memory is still 377.5MB. Free memory is still 239.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:36:04,489 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.66ms. Allocated memory is still 163.6MB. Free memory was 108.4MB in the beginning and 91.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.73ms. Allocated memory is still 163.6MB. Free memory was 91.2MB in the beginning and 86.6MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.27ms. Allocated memory is still 163.6MB. Free memory was 86.6MB in the beginning and 81.6MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 793.21ms. Allocated memory is still 163.6MB. Free memory was 81.6MB in the beginning and 115.8MB in the end (delta: -34.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11038.83ms. Allocated memory was 163.6MB in the beginning and 377.5MB in the end (delta: 213.9MB). Free memory was 114.9MB in the beginning and 239.2MB in the end (delta: -124.2MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB. * Witness Printer took 4.57ms. Allocated memory is still 377.5MB. Free memory is still 239.2MB. 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 187, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of bitwiseAnd at line 134. 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] double var_1_22 = 1.5; [L39] unsigned char var_1_23 = 0; [L40] unsigned char var_1_24 = 0; [L41] unsigned char var_1_25 = 0; [L42] unsigned char var_1_26 = 0; [L43] signed long int var_1_27 = 0; [L44] signed short int var_1_29 = 2; [L45] unsigned char var_1_31 = 1; [L46] signed long int var_1_32 = 32; [L47] signed long int var_1_34 = 0; [L48] unsigned char var_1_37 = 1; [L49] unsigned long int var_1_38 = 16; [L50] unsigned char var_1_39 = 0; [L51] unsigned char var_1_40 = 0; [L52] double last_1_var_1_1 = 256.5; [L53] float last_1_var_1_8 = 5.25; [L54] signed long int last_1_var_1_11 = 4; [L55] unsigned short int last_1_var_1_14 = 10000; [L56] unsigned short int last_1_var_1_17 = 4; [L57] 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_22=3/2, var_1_23=0, var_1_24=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] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L179] last_1_var_1_1 = var_1_1 [L180] last_1_var_1_8 = var_1_8 [L181] last_1_var_1_11 = var_1_11 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_17 = var_1_17 [L184] 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_22=3/2, var_1_23=0, var_1_24=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] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] [L143] 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_22=3/2, var_1_23=0, var_1_24=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] [L144] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] [L144] 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_22=3/2, var_1_23=0, var_1_24=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] [L145] var_1_3 = __VERIFIER_nondet_double() [L146] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] [L146] 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_22=3/2, var_1_23=0, var_1_24=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] [L147] var_1_4 = __VERIFIER_nondet_double() [L148] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] [L148] 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_22=3/2, var_1_23=0, var_1_24=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] [L149] var_1_5 = __VERIFIER_nondet_double() [L150] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] [L150] 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_22=3/2, var_1_23=0, var_1_24=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] [L151] var_1_7 = __VERIFIER_nondet_double() [L152] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] 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_22=3/2, var_1_23=0, var_1_24=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] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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_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_22=3/2, var_1_23=0, var_1_24=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] var_1_16 = __VERIFIER_nondet_ushort() [L155] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] 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_22=3/2, var_1_23=0, var_1_24=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] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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_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_22=3/2, var_1_23=0, var_1_24=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] var_1_19 = __VERIFIER_nondet_uchar() [L158] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] 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_22=3/2, var_1_23=0, var_1_24=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] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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_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_22=3/2, var_1_23=0, var_1_24=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] var_1_20 = __VERIFIER_nondet_uchar() [L161] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] 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_22=3/2, var_1_23=0, var_1_24=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] [L162] 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_22=3/2, var_1_23=0, var_1_24=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_22=3/2, var_1_23=0, var_1_24=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] [L162] 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_22=3/2, var_1_23=0, var_1_24=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] var_1_22 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 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=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_24=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_24=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] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 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=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_24=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] [L165] var_1_24 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_24 >= 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] [L166] RET assume_abort_if_not(var_1_24 >= 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] [L167] CALL assume_abort_if_not(var_1_24 <= 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_24=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_24=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] [L167] RET assume_abort_if_not(var_1_24 <= 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_24=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] [L168] var_1_25 = __VERIFIER_nondet_uchar() [L169] 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_24=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_24=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] [L169] 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_24=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] [L170] 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_24=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_24=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] [L170] 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_24=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] [L171] var_1_26 = __VERIFIER_nondet_uchar() [L172] 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_24=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_24=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] [L172] 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_24=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] [L173] 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_24=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_24=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] [L173] 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_24=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] [L174] var_1_40 = __VERIFIER_nondet_uchar() [L175] 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_24=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_24=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] [L175] 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_24=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] [L176] 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_24=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_24=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] [L176] 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_24=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] [L195] RET updateVariables() [L196] CALL step() [L61] COND FALSE !(\read(var_1_2)) [L70] 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_24=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] [L72] COND TRUE ! var_1_2 [L73] 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_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L77] 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_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L82] 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_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L83] 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_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L83] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L86] 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_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L93] COND TRUE var_1_4 <= last_1_var_1_1 [L94] 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_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L98] 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=253/4, var_1_23=0, var_1_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L99] 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=253/4, var_1_23=0, var_1_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L100] 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=253/4, var_1_23=0, var_1_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L104] var_1_21 = var_1_22 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_22=3, var_1_23=0, var_1_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L105] COND FALSE !(var_1_22 < (- var_1_8)) 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_22=3, var_1_23=0, var_1_24=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_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L112] var_1_27 = var_1_17 [L113] 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=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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, 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=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L114] COND FALSE !(var_1_11 == 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=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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, 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=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L117] COND FALSE !(var_1_18 < ((((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=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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, 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=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L122] COND TRUE var_1_18 < var_1_14 [L123] var_1_34 = 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=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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L133] var_1_37 = (var_1_23 && var_1_25) 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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L134] EXPR var_1_18 & var_1_14 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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L134] EXPR (var_1_18 & var_1_14) & 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=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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L134] COND FALSE !(((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) <= ((var_1_18 & var_1_14) & var_1_18)) [L137] COND FALSE !(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=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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L196] RET step() [L197] CALL, EXPR property() [L187] 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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] [L187-L188] 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) ; [L197] RET, EXPR property() [L197] 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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=0, 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_22=3, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=100, var_1_37=0, var_1_38=16, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 13, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2326 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2326 mSDsluCounter, 4962 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2858 mSDsCounter, 582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1370 IncrementalHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 582 mSolverCounterUnsat, 2104 mSDtfsCounter, 1370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 844 GetRequests, 794 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=685occurred in iteration=12, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1665 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2507 NumberOfCodeBlocks, 2507 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1865 ConstructedInterpolants, 0 QuantifiedInterpolants, 6671 SizeOfPredicates, 6 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 11088/11088 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-08 21:36:04,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_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 52dba7ee3ed26d722934af1549d91288e4a47bd5e304fc15e1e16045abb80069 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:36:06,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:36:06,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:36:06,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:36:06,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:36:06,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:36:06,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:36:06,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:36:06,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:36:06,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:36:06,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:36:06,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:36:06,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:36:06,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:36:06,851 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:36:06,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:36:06,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:36:06,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:36:06,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:36:06,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:36:06,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:36:06,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:36:06,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:36:06,857 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:36:06,857 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:36:06,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:36:06,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:36:06,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:36:06,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:36:06,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:36:06,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:36:06,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:36:06,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:36:06,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:36:06,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:36:06,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:36:06,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:36:06,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:36:06,865 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:36:06,866 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:36:06,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:36:06,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:36:06,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:36:06,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:36:06,867 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 -> 52dba7ee3ed26d722934af1549d91288e4a47bd5e304fc15e1e16045abb80069 [2024-11-08 21:36:07,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:36:07,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:36:07,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:36:07,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:36:07,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:36:07,220 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-pe-co_file-76.i [2024-11-08 21:36:08,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:36:08,976 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:36:08,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-76.i [2024-11-08 21:36:08,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46725f262/3ff5187d255f4214ab44958cd11ad308/FLAG89f685d35 [2024-11-08 21:36:08,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46725f262/3ff5187d255f4214ab44958cd11ad308 [2024-11-08 21:36:09,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:36:09,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:36:09,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:36:09,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:36:09,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:36:09,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:36:08" (1/1) ... [2024-11-08 21:36:09,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1527f9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09, skipping insertion in model container [2024-11-08 21:36:09,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:36:08" (1/1) ... [2024-11-08 21:36:09,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:36:09,245 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-pe-co_file-76.i[919,932] [2024-11-08 21:36:09,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:36:09,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:36:09,369 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-pe-co_file-76.i[919,932] [2024-11-08 21:36:09,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:36:09,443 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:36:09,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09 WrapperNode [2024-11-08 21:36:09,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:36:09,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:36:09,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:36:09,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:36:09,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,505 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-08 21:36:09,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:36:09,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:36:09,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:36:09,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:36:09,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,552 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-08 21:36:09,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:36:09,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:36:09,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:36:09,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:36:09,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (1/1) ... [2024-11-08 21:36:09,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:36:09,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:36:09,628 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-08 21:36:09,648 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-08 21:36:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:36:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:36:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:36:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:36:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:36:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:36:09,798 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:36:09,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:36:20,905 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:36:20,906 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:36:20,920 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:36:20,920 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:36:20,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:36:20 BoogieIcfgContainer [2024-11-08 21:36:20,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:36:20,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:36:20,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:36:20,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:36:20,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:36:08" (1/3) ... [2024-11-08 21:36:20,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1612ef04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:36:20, skipping insertion in model container [2024-11-08 21:36:20,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:36:09" (2/3) ... [2024-11-08 21:36:20,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1612ef04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:36:20, skipping insertion in model container [2024-11-08 21:36:20,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:36:20" (3/3) ... [2024-11-08 21:36:20,928 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-76.i [2024-11-08 21:36:20,955 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:36:20,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:36:21,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:36:21,040 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;@42673328, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:36:21,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:36:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 21:36:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 21:36:21,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:21,061 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:21,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:21,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash -239688751, now seen corresponding path program 1 times [2024-11-08 21:36:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:36:21,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336046974] [2024-11-08 21:36:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:21,085 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-08 21:36:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:36:21,088 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-08 21:36:21,090 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-08 21:36:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:22,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:36:22,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-08 21:36:22,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:36:22,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:36:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336046974] [2024-11-08 21:36:22,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336046974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:22,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:36:22,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897357048] [2024-11-08 21:36:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:22,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:36:22,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:36:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:36:22,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:36:22,129 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 21:36:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:22,158 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2024-11-08 21:36:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:36:22,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2024-11-08 21:36:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:22,169 INFO L225 Difference]: With dead ends: 154 [2024-11-08 21:36:22,169 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 21:36:22,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-08 21:36:22,176 INFO L432 NwaCegarLoop]: 117 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, 117 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-08 21:36:22,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:36:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 21:36:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 21:36:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 21:36:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-11-08 21:36:22,234 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 150 [2024-11-08 21:36:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:22,235 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-11-08 21:36:22,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 21:36:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-11-08 21:36:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 21:36:22,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:22,240 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:22,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:36:22,440 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-08 21:36:22,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:22,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash 855173513, now seen corresponding path program 1 times [2024-11-08 21:36:22,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:36:22,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778280558] [2024-11-08 21:36:22,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:22,445 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-08 21:36:22,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:36:22,447 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-08 21:36:22,448 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-08 21:36:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:23,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:36:23,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:36:26,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:36:26,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:36:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778280558] [2024-11-08 21:36:26,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778280558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:26,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:26,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:36:26,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469185852] [2024-11-08 21:36:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:26,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:36:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:36:26,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:36:26,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:36:26,499 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:30,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:36:34,810 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-08 21:36:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:36:34,824 INFO L93 Difference]: Finished difference Result 222 states and 345 transitions. [2024-11-08 21:36:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:36:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-11-08 21:36:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:36:34,914 INFO L225 Difference]: With dead ends: 222 [2024-11-08 21:36:34,914 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 21:36:34,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 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-08 21:36:34,916 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 46 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 226 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.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:36:34,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-08 21:36:34,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 21:36:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2024-11-08 21:36:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 21:36:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 229 transitions. [2024-11-08 21:36:34,968 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 229 transitions. Word has length 150 [2024-11-08 21:36:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:36:34,969 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 229 transitions. [2024-11-08 21:36:34,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 229 transitions. [2024-11-08 21:36:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 21:36:34,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:36:34,977 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:36:34,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 21:36:35,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:36:35,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:36:35,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:36:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1138971193, now seen corresponding path program 1 times [2024-11-08 21:36:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:36:35,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130487230] [2024-11-08 21:36:35,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:36:35,180 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-08 21:36:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:36:35,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:36:35,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 21:36:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:36:36,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:36:36,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:36:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 21:36:45,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:36:45,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:36:45,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130487230] [2024-11-08 21:36:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130487230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:36:45,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:36:45,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:36:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318409352] [2024-11-08 21:36:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:36:45,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:36:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:36:45,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:36:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:36:45,340 INFO L87 Difference]: Start difference. First operand 147 states and 229 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 21:36:48,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:36:56,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:37:00,710 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-08 21:37:04,719 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-08 21:37:09,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:37:13,112 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 []