./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.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_codestructure_dependencies_file-53.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 fa617a5ca77fc3b001e2a60d9350ce82cdfb1a774bde80f37c22028b912f277d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:23:56,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:23:56,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:23:56,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:23:56,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:23:56,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:23:56,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:23:56,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:23:56,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:23:56,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:23:56,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:23:56,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:23:56,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:23:56,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:23:56,503 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:23:56,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:23:56,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:23:56,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:23:56,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:23:56,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:23:56,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:23:56,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:23:56,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:23:56,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:23:56,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:23:56,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:23:56,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:23:56,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:23:56,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:23:56,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:23:56,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:23:56,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:23:56,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:23:56,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:23:56,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:23:56,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:23:56,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:23:56,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:23:56,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:23:56,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:23:56,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:23:56,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:23:56,513 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 -> fa617a5ca77fc3b001e2a60d9350ce82cdfb1a774bde80f37c22028b912f277d [2024-11-08 19:23:56,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:23:56,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:23:56,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:23:56,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:23:56,757 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:23:56,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i [2024-11-08 19:23:58,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:23:58,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:23:58,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i [2024-11-08 19:23:58,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd8559c9/a16ea1fec71c4d3d8a509f63d023adc9/FLAGbf5475161 [2024-11-08 19:23:58,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd8559c9/a16ea1fec71c4d3d8a509f63d023adc9 [2024-11-08 19:23:58,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:23:58,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:23:58,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:23:58,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:23:58,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:23:58,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56453350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58, skipping insertion in model container [2024-11-08 19:23:58,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:23:58,352 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_codestructure_dependencies_file-53.i[919,932] [2024-11-08 19:23:58,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:23:58,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:23:58,411 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_codestructure_dependencies_file-53.i[919,932] [2024-11-08 19:23:58,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:23:58,441 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:23:58,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58 WrapperNode [2024-11-08 19:23:58,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:23:58,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:23:58,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:23:58,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:23:58,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,483 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-08 19:23:58,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:23:58,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:23:58,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:23:58,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:23:58,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,514 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 19:23:58,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:23:58,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:23:58,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:23:58,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:23:58,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (1/1) ... [2024-11-08 19:23:58,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:23:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:23:58,560 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 19:23:58,562 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 19:23:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:23:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:23:58,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:23:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:23:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:23:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:23:58,659 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:23:58,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:23:58,916 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 19:23:58,916 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:23:58,927 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:23:58,927 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:23:58,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:58 BoogieIcfgContainer [2024-11-08 19:23:58,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:23:58,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:23:58,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:23:58,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:23:58,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:23:58" (1/3) ... [2024-11-08 19:23:58,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e28aa16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:23:58, skipping insertion in model container [2024-11-08 19:23:58,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:58" (2/3) ... [2024-11-08 19:23:58,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e28aa16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:23:58, skipping insertion in model container [2024-11-08 19:23:58,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:58" (3/3) ... [2024-11-08 19:23:58,933 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-53.i [2024-11-08 19:23:58,945 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:23:58,946 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:23:58,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:23:58,999 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;@5805ba47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:23:59,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:23:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 19:23:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 19:23:59,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:23:59,018 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:23:59,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:23:59,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash -435287175, now seen corresponding path program 1 times [2024-11-08 19:23:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:59,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461332327] [2024-11-08 19:23:59,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:23:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:23:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:23:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:23:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:23:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:23:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:23:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:23:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:23:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:23:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:23:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:23:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:23:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:23:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:23:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:23:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:23:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:23:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:59,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461332327] [2024-11-08 19:23:59,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461332327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:59,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:59,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:23:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56697325] [2024-11-08 19:23:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:59,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:23:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:59,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:23:59,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:23:59,386 INFO L87 Difference]: Start difference. First operand has 73 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 19:23:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:23:59,405 INFO L93 Difference]: Finished difference Result 139 states and 231 transitions. [2024-11-08 19:23:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:23:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 114 [2024-11-08 19:23:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:23:59,413 INFO L225 Difference]: With dead ends: 139 [2024-11-08 19:23:59,414 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 19:23:59,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 19:23:59,419 INFO L432 NwaCegarLoop]: 103 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, 103 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 19:23:59,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:23:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 19:23:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 19:23:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 19:23:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-08 19:23:59,450 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 114 [2024-11-08 19:23:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:23:59,450 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-08 19:23:59,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 19:23:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-08 19:23:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 19:23:59,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:23:59,453 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:23:59,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:23:59,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:23:59,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1860361775, now seen corresponding path program 1 times [2024-11-08 19:23:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:59,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025110941] [2024-11-08 19:23:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:23:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:23:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:23:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:23:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:23:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:23:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:23:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:23:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:23:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:23:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:23:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:23:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:23:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:23:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:23:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:23:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:23:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:23:59,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:59,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025110941] [2024-11-08 19:23:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025110941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:59,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:59,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:23:59,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285316900] [2024-11-08 19:23:59,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:59,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:23:59,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:23:59,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:23:59,661 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:23:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:23:59,725 INFO L93 Difference]: Finished difference Result 192 states and 288 transitions. [2024-11-08 19:23:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:23:59,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2024-11-08 19:23:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:23:59,732 INFO L225 Difference]: With dead ends: 192 [2024-11-08 19:23:59,732 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 19:23:59,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 19:23:59,733 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 81 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:23:59,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 246 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:23:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 19:23:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-08 19:23:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:23:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-11-08 19:23:59,755 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 114 [2024-11-08 19:23:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:23:59,755 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-11-08 19:23:59,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:23:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-11-08 19:23:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 19:23:59,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:23:59,759 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:23:59,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:23:59,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:23:59,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash 406346425, now seen corresponding path program 1 times [2024-11-08 19:23:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:59,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387314074] [2024-11-08 19:23:59,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:59,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:24:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:24:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:24:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:24:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:24:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:24:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:24:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:24:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:24:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:24:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:24:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:24:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:24:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:24:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:24:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:24:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:24:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:24:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:00,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387314074] [2024-11-08 19:24:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387314074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:00,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:24:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553527936] [2024-11-08 19:24:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:00,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:24:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:24:00,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:24:00,132 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:00,319 INFO L93 Difference]: Finished difference Result 415 states and 615 transitions. [2024-11-08 19:24:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:24:00,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2024-11-08 19:24:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:00,324 INFO L225 Difference]: With dead ends: 415 [2024-11-08 19:24:00,326 INFO L226 Difference]: Without dead ends: 294 [2024-11-08 19:24:00,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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 19:24:00,328 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 116 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:00,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 293 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:24:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-08 19:24:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 276. [2024-11-08 19:24:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 203 states have (on average 1.3399014778325122) internal successors, (272), 203 states have internal predecessors, (272), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 19:24:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 408 transitions. [2024-11-08 19:24:00,367 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 408 transitions. Word has length 115 [2024-11-08 19:24:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:00,367 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 408 transitions. [2024-11-08 19:24:00,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 408 transitions. [2024-11-08 19:24:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 19:24:00,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:00,371 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:00,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:24:00,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:00,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1790393331, now seen corresponding path program 1 times [2024-11-08 19:24:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:00,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081512548] [2024-11-08 19:24:00,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:24:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:24:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:24:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:24:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:24:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:24:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:24:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:24:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:24:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:24:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:24:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:24:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:24:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:24:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:24:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:24:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:24:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:24:00,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081512548] [2024-11-08 19:24:00,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081512548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:00,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:00,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:24:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054789131] [2024-11-08 19:24:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:00,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:00,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:00,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:00,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:00,613 INFO L87 Difference]: Start difference. First operand 276 states and 408 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:00,669 INFO L93 Difference]: Finished difference Result 697 states and 1037 transitions. [2024-11-08 19:24:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 116 [2024-11-08 19:24:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:00,673 INFO L225 Difference]: With dead ends: 697 [2024-11-08 19:24:00,673 INFO L226 Difference]: Without dead ends: 424 [2024-11-08 19:24:00,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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 19:24:00,675 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 60 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:00,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 189 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:24:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-08 19:24:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2024-11-08 19:24:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 313 states have (on average 1.3354632587859425) internal successors, (418), 313 states have internal predecessors, (418), 102 states have call successors, (102), 6 states have call predecessors, (102), 6 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-08 19:24:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 622 transitions. [2024-11-08 19:24:00,705 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 622 transitions. Word has length 116 [2024-11-08 19:24:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:00,706 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 622 transitions. [2024-11-08 19:24:00,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 622 transitions. [2024-11-08 19:24:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 19:24:00,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:00,708 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:00,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:24:00,708 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:00,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1189782445, now seen corresponding path program 1 times [2024-11-08 19:24:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:00,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042751871] [2024-11-08 19:24:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:24:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:24:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:24:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:24:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:24:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:24:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:24:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:24:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:24:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:24:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:24:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:24:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:24:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:24:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:24:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:24:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:24:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:24:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042751871] [2024-11-08 19:24:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042751871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:00,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:24:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042602462] [2024-11-08 19:24:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:00,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:00,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:00,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:00,828 INFO L87 Difference]: Start difference. First operand 422 states and 622 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:00,925 INFO L93 Difference]: Finished difference Result 1227 states and 1812 transitions. [2024-11-08 19:24:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:00,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 117 [2024-11-08 19:24:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:00,932 INFO L225 Difference]: With dead ends: 1227 [2024-11-08 19:24:00,932 INFO L226 Difference]: Without dead ends: 808 [2024-11-08 19:24:00,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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 19:24:00,934 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 95 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:00,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 261 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:24:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-08 19:24:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 428. [2024-11-08 19:24:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 319 states have (on average 1.329153605015674) internal successors, (424), 319 states have internal predecessors, (424), 102 states have call successors, (102), 6 states have call predecessors, (102), 6 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-08 19:24:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 628 transitions. [2024-11-08 19:24:00,983 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 628 transitions. Word has length 117 [2024-11-08 19:24:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:00,984 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 628 transitions. [2024-11-08 19:24:00,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 628 transitions. [2024-11-08 19:24:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 19:24:00,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:00,988 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:00,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:24:00,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:00,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 796755435, now seen corresponding path program 1 times [2024-11-08 19:24:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:00,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196539500] [2024-11-08 19:24:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:00,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:24:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:24:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:24:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:24:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:24:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:24:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:24:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:24:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:24:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:24:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:24:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:24:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:24:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:24:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:24:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:24:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:24:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 19:24:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196539500] [2024-11-08 19:24:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196539500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849968774] [2024-11-08 19:24:01,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:01,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:01,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:24:01,191 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 19:24:01,192 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 19:24:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:01,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:24:01,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 19:24:01,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 19:24:01,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849968774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:01,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:24:01,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-08 19:24:01,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482855195] [2024-11-08 19:24:01,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:01,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:24:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:01,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:24:01,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:24:01,574 INFO L87 Difference]: Start difference. First operand 428 states and 628 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 19:24:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:02,018 INFO L93 Difference]: Finished difference Result 1323 states and 1900 transitions. [2024-11-08 19:24:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 19:24:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2024-11-08 19:24:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:02,024 INFO L225 Difference]: With dead ends: 1323 [2024-11-08 19:24:02,024 INFO L226 Difference]: Without dead ends: 898 [2024-11-08 19:24:02,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:24:02,027 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 263 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:02,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 486 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:24:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-08 19:24:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 446. [2024-11-08 19:24:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 331 states have (on average 1.299093655589124) internal successors, (430), 331 states have internal predecessors, (430), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-08 19:24:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2024-11-08 19:24:02,079 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 117 [2024-11-08 19:24:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:02,080 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2024-11-08 19:24:02,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 19:24:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2024-11-08 19:24:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 19:24:02,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:02,081 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:02,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:24:02,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 19:24:02,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:02,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2041860249, now seen corresponding path program 1 times [2024-11-08 19:24:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103758706] [2024-11-08 19:24:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:24:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:24:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:24:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:24:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:24:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:24:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:24:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:24:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:24:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:24:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:24:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:24:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:24:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:24:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:24:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:24:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:24:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:24:02,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103758706] [2024-11-08 19:24:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103758706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:02,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:24:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633969864] [2024-11-08 19:24:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:02,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:24:02,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:02,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:24:02,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:24:02,448 INFO L87 Difference]: Start difference. First operand 446 states and 634 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:02,520 INFO L93 Difference]: Finished difference Result 448 states and 635 transitions. [2024-11-08 19:24:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 117 [2024-11-08 19:24:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:02,522 INFO L225 Difference]: With dead ends: 448 [2024-11-08 19:24:02,522 INFO L226 Difference]: Without dead ends: 159 [2024-11-08 19:24:02,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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 19:24:02,523 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:02,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 89 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:24:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-08 19:24:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-08 19:24:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 120 states have (on average 1.2583333333333333) internal successors, (151), 120 states have internal predecessors, (151), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:24:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 219 transitions. [2024-11-08 19:24:02,537 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 219 transitions. Word has length 117 [2024-11-08 19:24:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 219 transitions. [2024-11-08 19:24:02,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 219 transitions. [2024-11-08 19:24:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 19:24:02,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:02,538 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:02,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:24:02,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:02,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1093223675, now seen corresponding path program 1 times [2024-11-08 19:24:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032122068] [2024-11-08 19:24:02,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:24:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084005731] [2024-11-08 19:24:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:02,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:02,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:24:02,600 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 19:24:02,604 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 19:24:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:24:02,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:24:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:24:02,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:24:02,853 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:24:02,854 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:24:02,869 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 19:24:03,055 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,SelfDestructingSolverStorable7 [2024-11-08 19:24:03,058 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:03,127 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:24:03,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:24:03 BoogieIcfgContainer [2024-11-08 19:24:03,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:24:03,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:24:03,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:24:03,130 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:24:03,130 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:58" (3/4) ... [2024-11-08 19:24:03,131 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:24:03,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:24:03,133 INFO L158 Benchmark]: Toolchain (without parser) took 4950.22ms. Allocated memory was 167.8MB in the beginning and 213.9MB in the end (delta: 46.1MB). Free memory was 138.9MB in the beginning and 68.8MB in the end (delta: 70.1MB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2024-11-08 19:24:03,133 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 91.6MB. Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:24:03,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.35ms. Allocated memory is still 167.8MB. Free memory was 138.7MB in the beginning and 126.6MB in the end (delta: 12.1MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-08 19:24:03,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.13ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:24:03,133 INFO L158 Benchmark]: Boogie Preprocessor took 48.82ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 119.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:24:03,134 INFO L158 Benchmark]: RCFGBuilder took 393.81ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 96.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 19:24:03,134 INFO L158 Benchmark]: TraceAbstraction took 4200.20ms. Allocated memory was 167.8MB in the beginning and 213.9MB in the end (delta: 46.1MB). Free memory was 95.1MB in the beginning and 68.8MB in the end (delta: 26.4MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2024-11-08 19:24:03,134 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 213.9MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:24:03,135 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.09ms. Allocated memory is still 117.4MB. Free memory is still 91.6MB. Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.35ms. Allocated memory is still 167.8MB. Free memory was 138.7MB in the beginning and 126.6MB in the end (delta: 12.1MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.13ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 123.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.82ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 119.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 393.81ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 96.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4200.20ms. Allocated memory was 167.8MB in the beginning and 213.9MB in the end (delta: 46.1MB). Free memory was 95.1MB in the beginning and 68.8MB in the end (delta: 26.4MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 213.9MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of shiftLeft at line 52, overapproximation of someBinaryArithmeticFLOAToperation at line 56, overapproximation of someUnaryFLOAToperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] unsigned char last_1_var_1_1 = 0; [L40] unsigned long int last_1_var_1_9 = 10; [L41] signed short int last_1_var_1_14 = 32; [L42] unsigned char last_1_var_1_16 = 1; [L43] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=0, var_1_9=10] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L111] last_1_var_1_1 = var_1_1 [L112] last_1_var_1_9 = var_1_9 [L113] last_1_var_1_14 = var_1_14 [L114] last_1_var_1_16 = var_1_16 [L115] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=0, var_1_9=10] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L83] var_1_8 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L84] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L85] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L85] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L86] var_1_11 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L87] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L88] var_1_12 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L89] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L90] var_1_13 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L91] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L92] var_1_15 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L93] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L94] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L94] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L95] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L96] var_1_17 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L98] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L99] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L99] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L103] var_1_19 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L106] var_1_21 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L107] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L108] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L108] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L126] RET updateVariables() [L127] CALL step() [L47] COND FALSE !((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L52] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=1, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L52] COND TRUE (((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16) [L53] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L55] COND TRUE (! var_1_1) || var_1_8 [L56] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L64] var_1_20 = var_1_21 [L65] var_1_22 = var_1_12 [L66] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L67] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L70] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L70] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L71] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L76] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L77] COND TRUE ((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16) [L78] var_1_9 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L118] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L118-L119] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=5, var_1_15=-4294967286, var_1_16=5, var_1_17=-254, var_1_18=0, var_1_19=-251, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 8, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 740 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 723 mSDsluCounter, 1667 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 767 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 464 IncrementalHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 900 mSDtfsCounter, 464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 497 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 854 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1163 NumberOfCodeBlocks, 1163 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1035 ConstructedInterpolants, 0 QuantifiedInterpolants, 1480 SizeOfPredicates, 3 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4887/4896 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 19:24:03,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.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 fa617a5ca77fc3b001e2a60d9350ce82cdfb1a774bde80f37c22028b912f277d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:24:04,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:24:04,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:24:04,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:24:04,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:24:05,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:24:05,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:24:05,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:24:05,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:24:05,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:24:05,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:24:05,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:24:05,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:24:05,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:24:05,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:24:05,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:24:05,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:24:05,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:24:05,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:24:05,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:24:05,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:24:05,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:24:05,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:24:05,015 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:24:05,015 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:24:05,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:24:05,015 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:24:05,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:24:05,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:24:05,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:24:05,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:24:05,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:24:05,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:24:05,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:24:05,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:24:05,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:24:05,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:24:05,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:24:05,018 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:24:05,020 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:24:05,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:24:05,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:24:05,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:24:05,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:24:05,022 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 -> fa617a5ca77fc3b001e2a60d9350ce82cdfb1a774bde80f37c22028b912f277d [2024-11-08 19:24:05,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:24:05,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:24:05,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:24:05,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:24:05,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:24:05,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i [2024-11-08 19:24:06,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:24:06,739 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:24:06,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-53.i [2024-11-08 19:24:06,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aabb53598/f1f6407689854beb974e79e2f19f53eb/FLAG798f2cbfc [2024-11-08 19:24:06,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aabb53598/f1f6407689854beb974e79e2f19f53eb [2024-11-08 19:24:06,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:24:06,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:24:06,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:06,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:24:06,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:24:06,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2520dc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06, skipping insertion in model container [2024-11-08 19:24:06,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:24:06,933 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_codestructure_dependencies_file-53.i[919,932] [2024-11-08 19:24:06,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:07,012 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:24:07,021 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_codestructure_dependencies_file-53.i[919,932] [2024-11-08 19:24:07,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:07,056 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:24:07,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07 WrapperNode [2024-11-08 19:24:07,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:07,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:07,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:24:07,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:24:07,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,098 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-08 19:24:07,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:07,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:24:07,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:24:07,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:24:07,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,127 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 19:24:07,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:24:07,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:24:07,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:24:07,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:24:07,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:24:07,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:24:07,180 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 19:24:07,183 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 19:24:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:24:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:24:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:24:07,222 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:24:07,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:24:07,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:24:07,303 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:24:07,307 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:24:07,793 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:24:07,793 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:24:07,802 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:24:07,802 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:24:07,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:07 BoogieIcfgContainer [2024-11-08 19:24:07,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:24:07,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:24:07,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:24:07,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:24:07,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:24:06" (1/3) ... [2024-11-08 19:24:07,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b60ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:24:07, skipping insertion in model container [2024-11-08 19:24:07,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07" (2/3) ... [2024-11-08 19:24:07,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b60ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:24:07, skipping insertion in model container [2024-11-08 19:24:07,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:07" (3/3) ... [2024-11-08 19:24:07,808 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-53.i [2024-11-08 19:24:07,828 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:24:07,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:24:07,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:24:07,883 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;@308f9a84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:24:07,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:24:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 19:24:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 19:24:07,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:07,897 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:07,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:07,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:07,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1418741000, now seen corresponding path program 1 times [2024-11-08 19:24:07,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:24:07,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615239549] [2024-11-08 19:24:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:07,918 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 19:24:07,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:24:07,921 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 19:24:07,923 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 19:24:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:08,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:24:08,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-08 19:24:08,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:24:08,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:24:08,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615239549] [2024-11-08 19:24:08,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615239549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:08,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:08,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:24:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498788199] [2024-11-08 19:24:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:08,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:24:08,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:24:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:24:08,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:24:08,198 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 19:24:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:08,221 INFO L93 Difference]: Finished difference Result 103 states and 177 transitions. [2024-11-08 19:24:08,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:24:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2024-11-08 19:24:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:08,230 INFO L225 Difference]: With dead ends: 103 [2024-11-08 19:24:08,231 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 19:24:08,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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 19:24:08,237 INFO L432 NwaCegarLoop]: 76 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, 76 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 19:24:08,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:24:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 19:24:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 19:24:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 19:24:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2024-11-08 19:24:08,278 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 109 [2024-11-08 19:24:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:08,279 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2024-11-08 19:24:08,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 19:24:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2024-11-08 19:24:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 19:24:08,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:08,281 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:08,292 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 19:24:08,485 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 19:24:08,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:08,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:08,487 INFO L85 PathProgramCache]: Analyzing trace with hash -106686318, now seen corresponding path program 1 times [2024-11-08 19:24:08,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:24:08,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869349277] [2024-11-08 19:24:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:08,488 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 19:24:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:24:08,490 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 19:24:08,491 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 19:24:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:08,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:24:08,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:24:08,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:24:08,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:24:08,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869349277] [2024-11-08 19:24:08,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869349277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:08,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:08,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:24:08,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110745811] [2024-11-08 19:24:08,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:08,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:08,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:24:08,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:08,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:08,733 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:08,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:08,987 INFO L93 Difference]: Finished difference Result 145 states and 218 transitions. [2024-11-08 19:24:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:08,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 19:24:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:08,993 INFO L225 Difference]: With dead ends: 145 [2024-11-08 19:24:08,993 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 19:24:08,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 107 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 19:24:08,998 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 66 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:08,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 192 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:24:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 19:24:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-08 19:24:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 58 states have internal predecessors, (74), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:24:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-11-08 19:24:09,015 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 109 [2024-11-08 19:24:09,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:09,016 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-11-08 19:24:09,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-11-08 19:24:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 19:24:09,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:09,017 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:09,027 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 19:24:09,217 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 19:24:09,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 752131159, now seen corresponding path program 1 times [2024-11-08 19:24:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:24:09,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963523712] [2024-11-08 19:24:09,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:09,219 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 19:24:09,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:24:09,222 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 19:24:09,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:24:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:09,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:24:09,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:24:09,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:24:09,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:24:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963523712] [2024-11-08 19:24:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963523712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:09,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:24:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235199581] [2024-11-08 19:24:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:09,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:24:09,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:09,658 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:09,880 INFO L93 Difference]: Finished difference Result 193 states and 289 transitions. [2024-11-08 19:24:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-08 19:24:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:09,883 INFO L225 Difference]: With dead ends: 193 [2024-11-08 19:24:09,883 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 19:24:09,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 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 19:24:09,886 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:09,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 132 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:24:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 19:24:09,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-08 19:24:09,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:24:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 147 transitions. [2024-11-08 19:24:09,904 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 147 transitions. Word has length 110 [2024-11-08 19:24:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:09,905 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 147 transitions. [2024-11-08 19:24:09,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 147 transitions. [2024-11-08 19:24:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 19:24:09,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:09,906 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:09,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 19:24:10,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:24:10,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:10,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1934986076, now seen corresponding path program 1 times [2024-11-08 19:24:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:24:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372465848] [2024-11-08 19:24:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:10,112 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 19:24:10,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:24:10,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:24:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 19:24:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:10,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:24:10,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:24:10,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:24:10,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:24:10,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372465848] [2024-11-08 19:24:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372465848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:10,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:24:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121213368] [2024-11-08 19:24:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:10,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:24:10,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:10,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:10,340 INFO L87 Difference]: Start difference. First operand 99 states and 147 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:10,596 INFO L93 Difference]: Finished difference Result 249 states and 371 transitions. [2024-11-08 19:24:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-08 19:24:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:10,598 INFO L225 Difference]: With dead ends: 249 [2024-11-08 19:24:10,599 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 19:24:10,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 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 19:24:10,600 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 68 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:10,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 202 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:24:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 19:24:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 100. [2024-11-08 19:24:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:24:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2024-11-08 19:24:10,619 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 110 [2024-11-08 19:24:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2024-11-08 19:24:10,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:24:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2024-11-08 19:24:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 19:24:10,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:10,623 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:10,633 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 (5)] Ended with exit code 0 [2024-11-08 19:24:10,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 19:24:10,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:10,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1877727774, now seen corresponding path program 1 times [2024-11-08 19:24:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:24:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941546057] [2024-11-08 19:24:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:10,826 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 19:24:10,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:24:10,827 INFO L229 MonitoredProcess]: Starting monitored process 6 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 19:24:10,828 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 (6)] Waiting until timeout for monitored process [2024-11-08 19:24:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:11,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:24:11,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 19:24:11,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 19:24:11,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:24:11,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941546057] [2024-11-08 19:24:11,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941546057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:11,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:24:11,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-08 19:24:11,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298392000] [2024-11-08 19:24:11,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:11,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:24:11,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:24:11,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:24:11,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:24:11,334 INFO L87 Difference]: Start difference. First operand 100 states and 148 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 19:24:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:12,507 INFO L93 Difference]: Finished difference Result 316 states and 455 transitions. [2024-11-08 19:24:12,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:24:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 110 [2024-11-08 19:24:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:12,509 INFO L225 Difference]: With dead ends: 316 [2024-11-08 19:24:12,509 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 19:24:12,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2024-11-08 19:24:12,511 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 186 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:12,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 287 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 19:24:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 19:24:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 107. [2024-11-08 19:24:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:24:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-11-08 19:24:12,544 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 110 [2024-11-08 19:24:12,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:12,544 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-11-08 19:24:12,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 19:24:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-11-08 19:24:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 19:24:12,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:12,545 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:12,556 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 (6)] Ended with exit code 0 [2024-11-08 19:24:12,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 19:24:12,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:12,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash -90586491, now seen corresponding path program 1 times [2024-11-08 19:24:12,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:24:12,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836442082] [2024-11-08 19:24:12,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:12,748 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 19:24:12,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:24:12,749 INFO L229 MonitoredProcess]: Starting monitored process 7 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 19:24:12,749 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 (7)] Waiting until timeout for monitored process [2024-11-08 19:24:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:12,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 19:24:12,903 INFO L278 TraceCheckSpWp]: Computing forward predicates...