./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:03:48,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:03:48,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 03:03:48,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:03:48,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:03:48,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:03:48,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:03:48,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:03:48,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:03:48,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:03:48,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:03:48,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:03:48,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:03:48,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:03:48,819 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:03:48,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:03:48,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:03:48,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:03:48,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:03:48,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:03:48,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:03:48,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:03:48,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:03:48,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:03:48,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:03:48,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:03:48,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:03:48,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:03:48,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:03:48,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:03:48,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:03:48,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:03:48,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:03:48,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:03:48,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:03:48,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:03:48,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:03:48,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:03:48,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:03:48,827 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2024-11-10 03:03:49,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:03:49,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:03:49,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:03:49,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:03:49,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:03:49,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-10 03:03:50,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:03:50,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:03:50,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-10 03:03:50,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7205160b5/434fa886a1f04902bfc88b47a8fe3f62/FLAG156eb2b57 [2024-11-10 03:03:50,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7205160b5/434fa886a1f04902bfc88b47a8fe3f62 [2024-11-10 03:03:50,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:03:50,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:03:50,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:03:50,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:03:50,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:03:50,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:03:50" (1/1) ... [2024-11-10 03:03:50,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472df237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:50, skipping insertion in model container [2024-11-10 03:03:50,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:03:50" (1/1) ... [2024-11-10 03:03:50,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:03:51,104 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c[1259,1272] [2024-11-10 03:03:51,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:03:51,334 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:03:51,357 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c[1259,1272] [2024-11-10 03:03:51,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:03:51,480 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:03:51,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51 WrapperNode [2024-11-10 03:03:51,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:03:51,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:03:51,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:03:51,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:03:51,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:51,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:51,693 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2113 [2024-11-10 03:03:51,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:03:51,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:03:51,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:03:51,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:03:51,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:51,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:51,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:51,797 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-10 03:03:51,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:51,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:51,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:51,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:52,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:52,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:52,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:03:52,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:03:52,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:03:52,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:03:52,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (1/1) ... [2024-11-10 03:03:52,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:03:52,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:03:52,081 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-10 03:03:52,083 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-10 03:03:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:03:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:03:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:03:52,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:03:52,401 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:03:52,403 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:03:54,209 INFO L? ?]: Removed 1324 outVars from TransFormulas that were not future-live. [2024-11-10 03:03:54,209 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:03:54,273 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:03:54,274 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:03:54,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:03:54 BoogieIcfgContainer [2024-11-10 03:03:54,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:03:54,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:03:54,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:03:54,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:03:54,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:03:50" (1/3) ... [2024-11-10 03:03:54,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6195a564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:03:54, skipping insertion in model container [2024-11-10 03:03:54,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:03:51" (2/3) ... [2024-11-10 03:03:54,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6195a564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:03:54, skipping insertion in model container [2024-11-10 03:03:54,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:03:54" (3/3) ... [2024-11-10 03:03:54,280 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-10 03:03:54,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:03:54,293 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:03:54,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:03:54,350 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;@67635009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:03:54,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:03:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 534 states, 532 states have (on average 1.4962406015037595) internal successors, (796), 533 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 03:03:54,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:54,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:03:54,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:54,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1274963790, now seen corresponding path program 1 times [2024-11-10 03:03:54,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:54,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356346396] [2024-11-10 03:03:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:54,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:54,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356346396] [2024-11-10 03:03:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356346396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:03:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614009830] [2024-11-10 03:03:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:54,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:03:54,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:03:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:54,901 INFO L87 Difference]: Start difference. First operand has 534 states, 532 states have (on average 1.4962406015037595) internal successors, (796), 533 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:55,185 INFO L93 Difference]: Finished difference Result 1011 states and 1511 transitions. [2024-11-10 03:03:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:03:55,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-10 03:03:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:55,201 INFO L225 Difference]: With dead ends: 1011 [2024-11-10 03:03:55,201 INFO L226 Difference]: Without dead ends: 531 [2024-11-10 03:03:55,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:55,207 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 0 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:55,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1969 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:03:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-10 03:03:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2024-11-10 03:03:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.4943396226415093) internal successors, (792), 530 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2024-11-10 03:03:55,259 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 42 [2024-11-10 03:03:55,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:55,260 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2024-11-10 03:03:55,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2024-11-10 03:03:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 03:03:55,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:55,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:03:55,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:03:55,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:55,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash -724117663, now seen corresponding path program 1 times [2024-11-10 03:03:55,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:55,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426801242] [2024-11-10 03:03:55,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:55,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:55,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426801242] [2024-11-10 03:03:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426801242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:55,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:55,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:03:55,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72730837] [2024-11-10 03:03:55,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:55,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:03:55,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:55,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:03:55,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:55,411 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:55,780 INFO L93 Difference]: Finished difference Result 1010 states and 1507 transitions. [2024-11-10 03:03:55,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:03:55,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-10 03:03:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:55,783 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 03:03:55,783 INFO L226 Difference]: Without dead ends: 533 [2024-11-10 03:03:55,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:03:55,785 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 0 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:55,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1966 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:03:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-10 03:03:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2024-11-10 03:03:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.4924812030075187) internal successors, (794), 532 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 794 transitions. [2024-11-10 03:03:55,799 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 794 transitions. Word has length 43 [2024-11-10 03:03:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:55,800 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 794 transitions. [2024-11-10 03:03:55,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 794 transitions. [2024-11-10 03:03:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 03:03:55,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:55,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:03:55,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:03:55,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:55,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1225566729, now seen corresponding path program 1 times [2024-11-10 03:03:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:55,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888251775] [2024-11-10 03:03:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:55,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:56,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:56,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888251775] [2024-11-10 03:03:56,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888251775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:56,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:56,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:03:56,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75950503] [2024-11-10 03:03:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:56,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:03:56,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:56,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:03:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:03:56,072 INFO L87 Difference]: Start difference. First operand 533 states and 794 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:56,334 INFO L93 Difference]: Finished difference Result 1016 states and 1514 transitions. [2024-11-10 03:03:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:03:56,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-10 03:03:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:56,336 INFO L225 Difference]: With dead ends: 1016 [2024-11-10 03:03:56,337 INFO L226 Difference]: Without dead ends: 537 [2024-11-10 03:03:56,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:03:56,338 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 761 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:56,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1959 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:03:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-10 03:03:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 536. [2024-11-10 03:03:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.4897196261682244) internal successors, (797), 535 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 797 transitions. [2024-11-10 03:03:56,356 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 797 transitions. Word has length 44 [2024-11-10 03:03:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:56,356 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 797 transitions. [2024-11-10 03:03:56,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 797 transitions. [2024-11-10 03:03:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 03:03:56,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:56,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:03:56,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:03:56,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:56,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -928166756, now seen corresponding path program 1 times [2024-11-10 03:03:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:56,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396934716] [2024-11-10 03:03:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:56,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:56,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396934716] [2024-11-10 03:03:56,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396934716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:56,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:56,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:03:56,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739270043] [2024-11-10 03:03:56,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:56,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:03:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:56,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:03:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:03:56,758 INFO L87 Difference]: Start difference. First operand 536 states and 797 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:57,146 INFO L93 Difference]: Finished difference Result 1016 states and 1512 transitions. [2024-11-10 03:03:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:03:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-10 03:03:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:57,149 INFO L225 Difference]: With dead ends: 1016 [2024-11-10 03:03:57,149 INFO L226 Difference]: Without dead ends: 534 [2024-11-10 03:03:57,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:03:57,150 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 752 mSDsluCounter, 2581 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 3229 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:57,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 3229 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:03:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-10 03:03:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 531. [2024-11-10 03:03:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.490566037735849) internal successors, (790), 530 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 790 transitions. [2024-11-10 03:03:57,158 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 790 transitions. Word has length 45 [2024-11-10 03:03:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:57,158 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 790 transitions. [2024-11-10 03:03:57,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 790 transitions. [2024-11-10 03:03:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 03:03:57,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:57,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:03:57,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:03:57,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:57,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:57,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1969527860, now seen corresponding path program 1 times [2024-11-10 03:03:57,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:57,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730065853] [2024-11-10 03:03:57,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:03:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:03:57,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:03:57,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730065853] [2024-11-10 03:03:57,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730065853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:03:57,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:03:57,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:03:57,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919064953] [2024-11-10 03:03:57,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:03:57,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:03:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:03:57,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:03:57,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:03:57,582 INFO L87 Difference]: Start difference. First operand 531 states and 790 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:03:57,890 INFO L93 Difference]: Finished difference Result 1017 states and 1513 transitions. [2024-11-10 03:03:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:03:57,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-10 03:03:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:03:57,893 INFO L225 Difference]: With dead ends: 1017 [2024-11-10 03:03:57,893 INFO L226 Difference]: Without dead ends: 540 [2024-11-10 03:03:57,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:03:57,898 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 770 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:03:57,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 2586 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:03:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-10 03:03:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2024-11-10 03:03:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4887640449438202) internal successors, (795), 534 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 795 transitions. [2024-11-10 03:03:57,908 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 795 transitions. Word has length 45 [2024-11-10 03:03:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:03:57,908 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 795 transitions. [2024-11-10 03:03:57,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:03:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 795 transitions. [2024-11-10 03:03:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 03:03:57,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:03:57,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:03:57,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:03:57,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:03:57,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:03:57,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1340063289, now seen corresponding path program 1 times [2024-11-10 03:03:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:03:57,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055785190] [2024-11-10 03:03:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:03:57,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:03:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:03:57,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:03:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:03:58,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:03:58,011 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:03:58,011 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:03:58,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:03:58,020 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 03:03:58,079 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:03:58,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:03:58 BoogieIcfgContainer [2024-11-10 03:03:58,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:03:58,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:03:58,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:03:58,086 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:03:58,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:03:54" (3/4) ... [2024-11-10 03:03:58,088 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:03:58,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:03:58,089 INFO L158 Benchmark]: Toolchain (without parser) took 7243.26ms. Allocated memory was 192.9MB in the beginning and 583.0MB in the end (delta: 390.1MB). Free memory was 120.5MB in the beginning and 227.0MB in the end (delta: -106.5MB). Peak memory consumption was 287.9MB. Max. memory is 16.1GB. [2024-11-10 03:03:58,090 INFO L158 Benchmark]: CDTParser took 4.01ms. Allocated memory is still 192.9MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:03:58,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.11ms. Allocated memory is still 192.9MB. Free memory was 120.3MB in the beginning and 123.6MB in the end (delta: -3.2MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-10 03:03:58,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 211.95ms. Allocated memory is still 192.9MB. Free memory was 123.6MB in the beginning and 75.3MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-10 03:03:58,091 INFO L158 Benchmark]: Boogie Preprocessor took 348.78ms. Allocated memory is still 192.9MB. Free memory was 75.3MB in the beginning and 125.8MB in the end (delta: -50.5MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-11-10 03:03:58,092 INFO L158 Benchmark]: IcfgBuilder took 2230.62ms. Allocated memory was 192.9MB in the beginning and 385.9MB in the end (delta: 192.9MB). Free memory was 125.8MB in the beginning and 200.6MB in the end (delta: -74.8MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2024-11-10 03:03:58,093 INFO L158 Benchmark]: TraceAbstraction took 3809.39ms. Allocated memory was 385.9MB in the beginning and 583.0MB in the end (delta: 197.1MB). Free memory was 199.6MB in the beginning and 227.0MB in the end (delta: -27.4MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. [2024-11-10 03:03:58,093 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 583.0MB. Free memory is still 227.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:03:58,094 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.01ms. Allocated memory is still 192.9MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.11ms. Allocated memory is still 192.9MB. Free memory was 120.3MB in the beginning and 123.6MB in the end (delta: -3.2MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 211.95ms. Allocated memory is still 192.9MB. Free memory was 123.6MB in the beginning and 75.3MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 348.78ms. Allocated memory is still 192.9MB. Free memory was 75.3MB in the beginning and 125.8MB in the end (delta: -50.5MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * IcfgBuilder took 2230.62ms. Allocated memory was 192.9MB in the beginning and 385.9MB in the end (delta: 192.9MB). Free memory was 125.8MB in the beginning and 200.6MB in the end (delta: -74.8MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3809.39ms. Allocated memory was 385.9MB in the beginning and 583.0MB in the end (delta: 197.1MB). Free memory was 199.6MB in the beginning and 227.0MB in the end (delta: -27.4MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 583.0MB. Free memory is still 227.0MB. 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: 21]: 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 bitwiseAnd at line 165. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 3); [L36] const SORT_45 msb_SORT_45 = (SORT_45)1 << (3 - 1); [L38] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4); [L39] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1); [L41] const SORT_143 mask_SORT_143 = (SORT_143)-1 >> (sizeof(SORT_143) * 8 - 32); [L42] const SORT_143 msb_SORT_143 = (SORT_143)1 << (32 - 1); [L44] const SORT_167 mask_SORT_167 = (SORT_167)-1 >> (sizeof(SORT_167) * 8 - 2); [L45] const SORT_167 msb_SORT_167 = (SORT_167)1 << (2 - 1); [L47] const SORT_3 var_7 = 0; [L48] const SORT_1 var_11 = 0; [L49] const SORT_1 var_20 = 1; [L50] const SORT_5 var_32 = 0; [L51] const SORT_45 var_46 = 0; [L52] const SORT_45 var_50 = 2; [L53] const SORT_45 var_54 = 1; [L54] const SORT_45 var_59 = 4; [L55] const SORT_45 var_61 = 5; [L56] const SORT_45 var_65 = 3; [L57] const SORT_3 var_73 = 2; [L58] const SORT_45 var_103 = 7; [L59] const SORT_45 var_108 = 6; [L60] const SORT_143 var_145 = 0; [L61] const SORT_3 var_176 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_164; [L67] SORT_3 input_165; [L68] SORT_3 input_166; [L69] SORT_3 input_175; [L70] SORT_3 input_185; [L71] SORT_3 input_186; [L72] SORT_3 input_187; [L73] SORT_3 input_190; [L74] SORT_3 input_209; [L75] SORT_3 input_210; [L76] SORT_3 input_211; [L77] SORT_3 input_214; [L78] SORT_3 input_216; [L79] SORT_167 input_230; [L80] SORT_167 input_231; [L81] SORT_167 input_232; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L83] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L84] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L85] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L86] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L87] SORT_3 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L88] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L89] SORT_5 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L90] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L91] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L92] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L93] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L94] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_45 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L95] SORT_45 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_45; [L97] SORT_3 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_3 init_14_arg_1 = var_7; [L100] state_13 = init_14_arg_1 [L101] SORT_3 init_25_arg_1 = var_7; [L102] state_24 = init_25_arg_1 [L103] SORT_3 init_27_arg_1 = var_7; [L104] state_26 = init_27_arg_1 [L105] SORT_3 init_29_arg_1 = var_7; [L106] state_28 = init_29_arg_1 [L107] SORT_1 init_31_arg_1 = var_11; [L108] state_30 = init_31_arg_1 [L109] SORT_5 init_34_arg_1 = var_32; [L110] state_33 = init_34_arg_1 [L111] SORT_3 init_36_arg_1 = var_7; [L112] state_35 = init_36_arg_1 [L113] SORT_3 init_38_arg_1 = var_7; [L114] state_37 = init_38_arg_1 [L115] SORT_3 init_40_arg_1 = var_7; [L116] state_39 = init_40_arg_1 [L117] SORT_3 init_42_arg_1 = var_7; [L118] state_41 = init_42_arg_1 [L119] SORT_3 init_44_arg_1 = var_7; [L120] state_43 = init_44_arg_1 [L121] SORT_45 init_48_arg_1 = var_46; [L122] state_47 = init_48_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_164 = __VERIFIER_nondet_uchar() [L129] input_165 = __VERIFIER_nondet_uchar() [L130] input_166 = __VERIFIER_nondet_uchar() [L131] input_175 = __VERIFIER_nondet_uchar() [L132] input_185 = __VERIFIER_nondet_uchar() [L133] input_186 = __VERIFIER_nondet_uchar() [L134] input_187 = __VERIFIER_nondet_uchar() [L135] input_190 = __VERIFIER_nondet_uchar() [L136] input_209 = __VERIFIER_nondet_uchar() [L137] input_210 = __VERIFIER_nondet_uchar() [L138] input_211 = __VERIFIER_nondet_uchar() [L139] input_214 = __VERIFIER_nondet_uchar() [L140] input_216 = __VERIFIER_nondet_uchar() [L141] input_230 = __VERIFIER_nondet_uchar() [L142] input_231 = __VERIFIER_nondet_uchar() [L143] input_232 = __VERIFIER_nondet_uchar() [L146] SORT_3 var_10_arg_0 = state_8; [L147] SORT_1 var_10 = var_10_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_10=0, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] EXPR var_10 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L148] var_10 = var_10 & mask_SORT_1 [L149] SORT_1 var_12_arg_0 = var_10; [L150] SORT_1 var_12_arg_1 = var_11; [L151] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1; [L152] SORT_3 var_15_arg_0 = state_13; [L153] SORT_1 var_15 = var_15_arg_0 >> 0; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_15=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L154] var_15 = var_15 & mask_SORT_1 [L155] SORT_1 var_16_arg_0 = var_15; [L156] SORT_1 var_16_arg_1 = var_11; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_12; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_17_arg_0=1, var_17_arg_1=1, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_1 var_21_arg_0 = var_17; [L162] SORT_1 var_21 = ~var_21_arg_0; [L163] SORT_1 var_22_arg_0 = var_20; [L164] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_22_arg_0=1, var_22_arg_1=-2, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L165] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L166] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0] [L166] var_22 = var_22 & mask_SORT_1 [L167] SORT_1 bad_23_arg_0 = var_22; [L168] CALL __VERIFIER_assert(!(bad_23_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 534 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2283 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2283 mSDsluCounter, 11709 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8442 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2481 IncrementalHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 3267 mSDtfsCounter, 2481 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=536occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-10 03:03:58,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:04:00,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:04:00,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 03:04:00,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:04:00,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:04:00,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:04:00,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:04:00,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:04:00,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:04:00,372 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:04:00,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:04:00,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:04:00,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:04:00,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:04:00,374 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:04:00,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:04:00,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:04:00,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:04:00,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:04:00,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:04:00,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:04:00,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:04:00,379 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:04:00,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:04:00,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:04:00,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:04:00,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:04:00,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:04:00,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:04:00,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:04:00,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:04:00,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:04:00,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:04:00,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:04:00,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:04:00,381 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:04:00,381 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:04:00,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:04:00,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:04:00,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:04:00,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:04:00,383 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0 [2024-11-10 03:04:00,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:04:00,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:04:00,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:04:00,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:04:00,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:04:00,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-10 03:04:02,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:04:02,339 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:04:02,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-10 03:04:02,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106f7d94b/754a77199fd3468e83217b7c04dd4ccf/FLAG0f52a361c [2024-11-10 03:04:02,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/106f7d94b/754a77199fd3468e83217b7c04dd4ccf [2024-11-10 03:04:02,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:04:02,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:04:02,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:04:02,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:04:02,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:04:02,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:02,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7c14e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02, skipping insertion in model container [2024-11-10 03:04:02,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:02,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:04:02,586 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c[1259,1272] [2024-11-10 03:04:02,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:04:02,854 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:04:02,863 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c[1259,1272] [2024-11-10 03:04:02,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:04:02,945 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:04:02,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02 WrapperNode [2024-11-10 03:04:02,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:04:02,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:04:02,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:04:02,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:04:02,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:02,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,021 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1071 [2024-11-10 03:04:03,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:04:03,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:04:03,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:04:03,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:04:03,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,134 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-10 03:04:03,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:04:03,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:04:03,200 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:04:03,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:04:03,201 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (1/1) ... [2024-11-10 03:04:03,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:04:03,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:04:03,238 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-10 03:04:03,241 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-10 03:04:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:04:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:04:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:04:03,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:04:03,477 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:04:03,479 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:04:04,477 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-10 03:04:04,477 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:04:04,486 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:04:04,486 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:04:04,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:04 BoogieIcfgContainer [2024-11-10 03:04:04,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:04:04,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:04:04,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:04:04,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:04:04,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:04:02" (1/3) ... [2024-11-10 03:04:04,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a94b610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:04, skipping insertion in model container [2024-11-10 03:04:04,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:02" (2/3) ... [2024-11-10 03:04:04,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a94b610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:04, skipping insertion in model container [2024-11-10 03:04:04,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:04" (3/3) ... [2024-11-10 03:04:04,493 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c [2024-11-10 03:04:04,506 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:04:04,506 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:04:04,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:04:04,549 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;@3c6f0d3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:04:04,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:04:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 03:04:04,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:04,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 03:04:04,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 03:04:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:04:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772986324] [2024-11-10 03:04:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:04,571 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-10 03:04:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:04:04,573 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-10 03:04:04,574 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-10 03:04:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:04,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 03:04:04,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:04:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:04,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:04:04,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:04:04,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772986324] [2024-11-10 03:04:04,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772986324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:04:04,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:04:04,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:04:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986413039] [2024-11-10 03:04:04,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:04:04,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:04:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:04:04,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:04:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:04:04,977 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:05,038 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 03:04:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:04:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 03:04:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:05,045 INFO L225 Difference]: With dead ends: 22 [2024-11-10 03:04:05,045 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 03:04:05,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 03:04:05,049 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:05,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:04:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 03:04:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 03:04:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 03:04:05,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 03:04:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:05,073 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 03:04:05,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 03:04:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 03:04:05,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:05,074 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:04:05,083 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-10 03:04:05,277 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-10 03:04:05,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:05,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 03:04:05,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:04:05,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733022182] [2024-11-10 03:04:05,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:04:05,282 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-10 03:04:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:04:05,286 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-10 03:04:05,287 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-10 03:04:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:04:05,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 03:04:05,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:04:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:05,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:04:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:07,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:04:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733022182] [2024-11-10 03:04:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733022182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:04:07,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:04:07,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 03:04:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550957905] [2024-11-10 03:04:07,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:04:07,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:04:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:04:07,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:04:07,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:04:07,234 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:07,377 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-10 03:04:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:04:07,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 03:04:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:07,378 INFO L225 Difference]: With dead ends: 17 [2024-11-10 03:04:07,378 INFO L226 Difference]: Without dead ends: 14 [2024-11-10 03:04:07,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:04:07,379 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:07,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:04:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-10 03:04:07,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-11-10 03:04:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 03:04:07,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 03:04:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:07,382 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 03:04:07,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 03:04:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 03:04:07,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:07,383 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 03:04:07,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:04:07,587 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-10 03:04:07,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:07,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 03:04:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:04:07,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207093921] [2024-11-10 03:04:07,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 03:04:07,589 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-10 03:04:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:04:07,592 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-10 03:04:07,593 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-10 03:04:07,941 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 03:04:07,941 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 03:04:07,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 03:04:07,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:04:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:08,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:04:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:53,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:04:53,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207093921] [2024-11-10 03:04:53,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207093921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:04:53,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:04:53,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 03:04:53,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643973960] [2024-11-10 03:04:53,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:04:53,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:04:53,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:04:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:04:53,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:04:53,724 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:04:54,224 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-10 03:04:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:04:54,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-10 03:04:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:04:54,225 INFO L225 Difference]: With dead ends: 20 [2024-11-10 03:04:54,225 INFO L226 Difference]: Without dead ends: 17 [2024-11-10 03:04:54,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:04:54,226 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:04:54,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:04:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-10 03:04:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-10 03:04:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-10 03:04:54,230 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2024-11-10 03:04:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:04:54,230 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-10 03:04:54,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 03:04:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-10 03:04:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 03:04:54,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:04:54,231 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-10 03:04:54,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 03:04:54,435 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-10 03:04:54,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:04:54,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:04:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 3 times [2024-11-10 03:04:54,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:04:54,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620692190] [2024-11-10 03:04:54,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 03:04:54,439 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-10 03:04:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:04:54,443 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-10 03:04:54,444 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-10 03:04:54,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-10 03:04:54,902 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 03:04:54,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-10 03:04:54,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:04:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 03:04:55,620 INFO L311 TraceCheckSpWp]: Computing backward predicates...